Regularity of splicing languages
Discrete Applied Mathematics
Discrete Applied Mathematics
Handbook of formal languages, vol. 1
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Discrete Applied Mathematics
Splicing in abstract families of languages
Theoretical Computer Science
Where mathematics, computer science, linguistics and biology meet
Theory of Codes
Circular DNA and Splicing Systems
ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
Linear and circular splicing systems
INBS '95 Proceedings of the First International Symposium on Intelligence in Neural and Biological Systems (INBS'95)
The structure of reflexive regular splicing languages via Schützenberger constants
Theoretical Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
On the power of circular splicing
Discrete Applied Mathematics - Special issue: Max-algebra
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
On the regularity of circular splicing languages: a survey and new developments
Natural Computing: an international journal
Marked systems and circular splicing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
On the regularity of circular splicing languages: a survey and new developments
Natural Computing: an international journal
A characterization of (regular) circular languages generated by monotone complete splicing systems
Theoretical Computer Science
Splicing systems and the Chomsky hierarchy
Theoretical Computer Science
| Hi-index | 5.23 |
Splicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. A splicing system is defined by giving an initial set I and a set R of rules. Some unanswered questions are related to the computational power of circular splicing systems. In particular, a still open question is to find a characterization of circular languages generated by finite circular splicing systems (i.e., circular splicing systems with both I and R finite sets). In this paper we introduce a special class of the latter systems named marked systems. We prove that a marked system S generates a regular circular language if and only if S satisfies a special (decidable) property. As a consequence, we are able to characterize the structure of these regular circular languages.