Splicing semigroups of dominoes and DNA
Discrete Mathematics
Handbook of theoretical computer science (vol. B)
Regularity of splicing languages
Discrete Applied Mathematics
Discrete Applied Mathematics
Computational Modeling for Genetic Splicing Systems
SIAM Journal on Computing
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Automata, Languages, and Machines
Automata, Languages, and Machines
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Codes
Introduction to Formal Language Theory
Introduction to Formal Language Theory
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Recognizing splicing languages: Syntactic monoids and simultaneous pumping
Discrete Applied Mathematics
Decision problems for linear and circular splicing systems
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Regular languages generated by reflexive finite splicing systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
A decision procedure for reflexive regular splicing languages
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Hi-index | 0.04 |
Splicing systems were introduced by Head in 1987 as a formal counterpart of a biological mechanism of DNA recombination under the action of restriction and ligase enzymes. Despite the intensive studies on linear splicing systems, some elementary questions about their computational power are still open. In particular, in this paper we face the problem of characterizing the proper subclass of regular languages which are generated by finite (Paun) linear splicing systems. We introduce here the class of marker languages L, i.e., regular languages with the form L=L"1[x]"1L"2, where L"1,L"2 are regular languages, [x] is a syntactic congruence class satisfying special conditions and [x]"1 is either equal to [x] or equal to [x]@?{1}, 1 being the empty word. Using classical properties of formal language theory, we give an algorithm which allows us to decide whether a regular language is a marker language. Furthermore, for each marker language L we exhibit a finite Paun linear splicing system and we prove that this system generates L.