Circular splicing and regularity
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004) no. 3, pp. 189-228.

Voir la notice de l'article dans Numdam

Circular splicing has been very recently introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we restrict our study to the relationship between regular circular languages and languages generated by finite circular splicing systems and provide some results towards a characterization of the intersection between these two classes. We consider the class of languages X * , called here star languages, which are closed under conjugacy relation and with X being a regular language. Using automata theory and combinatorial techniques on words, we show that for a subclass of star languages the corresponding circular languages are (Paun) circular splicing languages. For example, star languages belong to this subclass when X * is a free monoid or X is a finite set. We also prove that each (Paun) circular splicing language L over a one-letter alphabet has the form L=X + Y, with X,Y finite sets satisfying particular hypotheses. Cyclic and weak cyclic languages, which will be introduced in this paper, show that this result does not hold when we increase the size of alphabets, even if we restrict ourselves to regular languages.

DOI : 10.1051/ita:2004010
Classification : 68Q05, 68Q45, 68Q70
Mots-clés : molecular computing, splicing systems, formal languages, automata theory, variable-length codes
@article{ITA_2004__38_3_189_0,
     author = {Bonizzoni, Paola and Felice, Clelia De and Mauri, Giancarlo and Zizza, Rosalba},
     title = {Circular splicing and regularity},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {189--228},
     publisher = {EDP-Sciences},
     volume = {38},
     number = {3},
     year = {2004},
     doi = {10.1051/ita:2004010},
     zbl = {1082.68048},
     mrnumber = {2076400},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2004010/}
}
TY  - JOUR
AU  - Bonizzoni, Paola
AU  - Felice, Clelia De
AU  - Mauri, Giancarlo
AU  - Zizza, Rosalba
TI  - Circular splicing and regularity
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2004
SP  - 189
EP  - 228
VL  - 38
IS  - 3
PB  - EDP-Sciences
UR  - https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2004010/
DO  - 10.1051/ita:2004010
LA  - en
ID  - ITA_2004__38_3_189_0
ER  - 
%0 Journal Article
%A Bonizzoni, Paola
%A Felice, Clelia De
%A Mauri, Giancarlo
%A Zizza, Rosalba
%T Circular splicing and regularity
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2004
%P 189-228
%V 38
%N 3
%I EDP-Sciences
%U https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2004010/
%R 10.1051/ita:2004010
%G en
%F ITA_2004__38_3_189_0
Bonizzoni, Paola; Felice, Clelia De; Mauri, Giancarlo; Zizza, Rosalba. Circular splicing and regularity. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004) no. 3, pp. 189-228. doi : 10.1051/ita:2004010. https://geodesic-test.mathdoc.fr/articles/10.1051/ita:2004010/

Cité par Sources :