Information Sciences: an International Journal
Regularity of splicing languages
Discrete Applied Mathematics
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
Where mathematics, computer science, linguistics and biology meet
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Conditions Enforcing Regularity of Context-Free Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Circular DNA and Splicing Systems
ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Well quasi-orders and context-free grammars
Theoretical Computer Science - Developments in language theory
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
On the power of circular splicing
Discrete Applied Mathematics - Special issue: Max-algebra
A characterization of regular circular languages generated by marked splicing systems
Theoretical Computer Science
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
Splicing systems and the Chomsky hierarchy
Theoretical Computer Science
| Hi-index | 5.23 |
Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. Some unanswered questions are related to the computational power of such systems, and finding a characterization of the class of circular languages generated by circular splicing systems is still an open problem. In this paper we solve this problem for monotone complete systems, which are finite circular splicing systems with rules of a simpler form. We show that a circular language L is generated by a monotone complete system if and only if the set Lin(L) of all words corresponding to L is a pure unitary language generated by a set closed under the conjugacy relation. The class of pure unitary languages was introduced by A. Ehrenfeucht, D. Haussler, G. Rozenberg in 1983, as a subclass of the class of context-free languages, together with a characterization of regular pure unitary languages by means of a decidable property. As a direct consequence, we characterize (regular) circular languages generated by monotone complete systems. We can also decide whether the language generated by a monotone complete system is regular. Finally, we point out that monotone complete systems have the same computational power as finite simple systems, an easy type of circular splicing system defined in the literature from the very beginning, when only one rule of a specific type is allowed. From our results on monotone complete systems, it follows that finite simple systems generate a class of languages containing non-regular languages, showing the incorrectness of a longstanding result on simple systems.