Circular splicing and regularity

Bonizzoni, Paola ; Felice, Clelia De ; Mauri, Giancarlo ; Zizza, Rosalba

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 38 (2004), p. 189-228 / Harvested from Numdam

Résumé

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^+ \cup 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.

Détail

Publié le : 2004-01-01

MR 2076400 | Zbl 1082.68048

DOI : https://doi.org/10.1051/ita:2004010
Classification:  68Q05,  68Q45,  68Q70

Bibliographie

[1] L.M. Adleman, Molecular computation of solutions to combinatorial problems. Science 226 (1994) 1021-1024.

[2] J. Berstel and D. Perrin, Theory of codes. Academic Press, New York (1995). | MR 797069 | Zbl 0587.68066

[3] J. Berstel and A. Restivo, Codes et sousmonoides fermes par conjugaison. Sem. LITP 81-45 (1981) $10$.

[4] P. Bonizzoni, C. De Felice and R. Zizza, The structure of reflexive regular splicing languages via Schützenberger constants (submitted). | Zbl 1080.68049

[5] P. Bonizzoni, C. De Felice, G. Mauri and R. Zizza, DNA and circular splicing 2054 (2001) 117-129. | Zbl 0984.68095

[6] P. Bonizzoni, C. De Felice, G. Mauri and R. Zizza, Linear and circular splicing, in WORDS99 (1999).

[7] P. Bonizzoni, C. De Felice, G. Mauri and R. Zizza, Decision Problems on Linear and Circular Splicing 2450 (2003) 78-92. | Zbl 1015.68101

[8] P. Bonizzoni, C. De Felice, G. Mauri and R. Zizza, Regular Languages Generated by Reflexive Finite Linear Splicing Systems 2710 (2003) 134-145. | Zbl 1037.68073

[9] P. Bonizzoni, C. De Felice, G. Mauri and R. Zizza, Linear splicing and syntactic monoid (submitted). | Zbl 1095.68048

[10] P. Bonizzoni, C. De Felice, G. Mauri and R. Zizza, On the power of circular splicing (submitted). | Zbl 1083.68055

[11] P. Bonizzoni, C. Ferretti, G. Mauri and R. Zizza, Separating some splicing models. Inform. Process. Lett. 79 (2001) 255-259. | Zbl 1051.68090

[12] C. Choffrut and J. Karhumaki, Combinatorics on Words, in Handbook of Formal Languages, edited by G. Rozenberg and A. Salomaa. Springer, Vol. 1 (1996) 329-438.

[13] K. Culik and T. Harju, Splicing semigroups of dominoes and DNA. Discrete Appl. Math. 31 (1991) 261-277. | Zbl 0747.20035

[14] L. Fuchs, Abelian groups. Pergamon Press, Oxford, London, New York and Paris (1960). | MR 111783 | Zbl 0100.02803

[15] R.W. Gatterdam, Splicing systems and regularity. Intern. J. Comput. Math. 31 (1989) 63-67. | Zbl 0825.68443

[16] R.W. Gatterdam, Algorithms for splicing systems. SIAM J. Comput. 21 (1992) 507-520. | Zbl 0761.68050

[17] T. Head, Formal Language Theory and DNA: an analysis of the generative capacity of specific recombinant behaviours. Bull. Math. Biol. 49 (1987) 737-759. | Zbl 0655.92008

[18] T. Head, Circular suggestions for DNA Computing, in Pattern Formation in Biology, Vision and Dynamics, edited by A. Carbone, M. Gromov and P. Pruzinkiewicz. World Scientific, Singapore and London (2000) 325-335. | Zbl 1133.92300

[19] T. Head, Gh. Paun and D. Pixton, Language theory and molecular genetics: generative mechanisms suggested by DNA recombination, in Handbook of Formal Languages, edited by G. Rozenberg and A. Salomaa. Springer, Vol. 2 (1996) 295-360.

[20] T. Head, G. Rozenberg, R. Bladergroen, C. Breek, P. Lommerse and H. Spaink, Computing with DNA by operating on plasmids. BioSystems 57 (2000) 87-93.

[21] J.E. Hopcroft, R. Motwani and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass. (2001). | MR 645539 | Zbl 0980.68066

[22] S.M. Kim, Computational modeling for genetic splicing systems. SIAM J. Comput. 26 (1997) 1284-1309. | Zbl 0885.68058

[23] M. Lothaire, Combinatorics on Words, Encyclopedia of Math. and its Appl. Addison Wesley Publishing Company (1983). | MR 675953 | Zbl 0514.20045

[24] G. Paun, On the splicing operation. Discrete Appl. Math. 70 (1996) 57-79. | Zbl 0855.68051

[25] G. Paun, G. Rozenberg and A. Salomaa, DNA computing, New Computing Paradigms. Springer-Verlag (1998). | MR 1724525 | Zbl 0940.68053

[26] D. Pixton, Regularity of splicing languages. Discrete Appl. Math. 69 (1996) 101-124. | Zbl 0855.68052

[27] C. Reis and G. Thierren, Reflective star languages and codes. Inform. Control 42 (1979) 1-9. | Zbl 0408.68068

[28] R. Siromoney, K.G. Subramanian and A. Dare, Circular DNA and Splicing Systems, in Proc. of ICPIA. Springer, Lect. Notes Comput. Sci. 654 (1992) 260-273.