Splicing semigroups of dominoes and DNA
Discrete Mathematics
Algorithms for splicing systems
SIAM Journal on Computing
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
Handbook of formal languages, vol. 3
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Theory of Codes
Circular DNA and Splicing Systems
ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
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)
A characterization of (regular) circular languages generated by monotone complete splicing systems
Theoretical Computer Science
Recombinant DNA ,gene splicing as generative devices of formal languages
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Splicing systems and the Chomsky hierarchy
Theoretical Computer Science
Marked systems and circular splicing
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |
Circular splicing has been very recently introduced to model a specific recombinant behaviour of circular DNA, carrying on the investigation initiated with linear splicing. In this paper we restrict ourselves to the relationship between circular regular languages and circular splicing languages. We provide partial results towards a characterization of the class of circular regular languages generated by finite circular splicing systems. We consider a class of languages X* closed under conjugacy relation and with X a regular languages, called here star languages. Using automata theory and combinatorial techniques on words, we show that for a subclass of star languages the corresponding circular languages are circular (Paun) splicing languages. In particular, star languages with X being a finite set or X* being a free monoid belong to this subclass.