The structure of reflexive regular splicing languages via Schützenberger constants

Theoretical Computer Science

Volumn 334, Issue 1-3, 2005, Pages 71-98

  Bonizzoni, Paola ^a   De Felice, Clelia ^b   Zizza, Rosalba ^b  

^a Bicocca Edificio U7   (Italy)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

Automata; Molecular computing; Regular languages

Indexed keywords

AUTOMATA THEORY; DNA; ENZYMES; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

AUTOMATA; MOLECULAR COMPUTING; SCHÜTZENBERGER CONSTANTS; SPLICING SYSTEMS;

FORMAL LANGUAGES;

EID: 16344373420     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.12.033     Document Type: Article

References (25)

1. J. Berstel, and D. Perrin Theory of Codes 1985 Academic Press New York
2. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, Linear splicing and syntactic monoid, 2003, submitted for publication.
3. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, Decision problems on linear and circular splicing, in: M. Ito, M. Toyama (Eds.), Proc. DLT 2002, Lecture Notes in Computer Science, Vol. 2450, Springer, Berlin, 2003, pp. 78-92.
4. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, Regular languages generated by reflexive finite linear splicing systems, in: Z. Èsik, Z. Fülöp (Eds.), Proc. DLT 2003, Lecture Notes in Computer Science, Vol. 2710, Springer, Berlin, 2003, pp. 134-145.
5. P. Bonizzoni, C. Ferretti, G. Mauri, and R. Zizza Separating some splicing models Inform. Process. Lett. 76 6 2001 255 259
6. P. Bonizzoni, G. Mauri, Regular splicing languages and subclasses, Theor. Comput. Sci., to appear.
7. K. Culik, and T. Harju Splicing semigroups of dominoes and DNA Discrete Appl. Math. 31 1991 261 277
8. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974.
9. E. Goode Laun, Constants and splicing systems, Ph.D. Thesis, Binghamton University, 1999.
10. E. Goode, D. Pixton, Recognizing splicing languages: syntactic monoids and simultaneous pumping, 2004, submitted for publication (available from http://www.math.binghamton.edu/dennis/Papers/index.html).
11. M.A. Harrison Introduction to Formal Language Theory 1978 Addison-Wesley Reading, MA
12. T. Head Formal language theory and DNA an analysis of the generative capacity of specific recombinant behaviours Bull. Math. Biol. 49 1987 737 759
13. T. Head Splicing languages generated with one sided context Gh. Paun Computing with Bio-molecules Theory and Experiments 1998 Springer Berlin
14. T. Head, Gh. Paun, and D. Pixton Language theory and molecular genetics generative mechanisms suggested by DNA recombination G. Rozenberg A. Salomaa Handbook of Formal Languages Vol. 2 1996 Springer Berlin 295 360
15. J.E. Hopcroft, R. Motwani, and J.D. Ullman Introduction to Automata Theory, Languages, and Computation 2001 Addison-Wesley Reading, MA
16. S.M. Kim, An algorithm for identifying spliced languages, in: Proc. Cocoon97, Lecture Notes in Computer Science, Vol. 1276, Springer, Berlin, 1997, pp. 403-411.
17. S.M. Kim Computational modeling for genetic splicing systems SIAM J. Comput. 26 1997 1284 1309
18. R. McNaughton, and S. Papert Counter-Free Automata 1971 MIT Press Cambridge, MA
19. Gh. Paun On the splicing operation Discrete Appl. Math. 70 1996 57 79
20. Gh. Paun, G. Rozenberg, and A. Salomaa DNA Computing New Computing Paradigms 1998 Springer Berlin
21. D. Perrin, Finite automata, in: J. Van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Vol. B, Elsevier, Amsterdam, 1990, pp. 1-57.
22. D. Pixton Linear and circular splicing systems Proc. First Internat. Symp. on Intelligence in Neural and Biological Systems 1996 IEEE Computer Society Press Silver Spring, MD 181 188
23. D. Pixton Regularity of splicing languages Discrete Appl. Math. 69 1996 101 124
24. M.P. Schützenberger Sur certaines opérations de fermeture dans les langages rationnels Sympos. Math. 15 1975 245 253
25. S. Verlan, and R. Zizza 1-splicing vs. 2-splicing separating results Proc. Words03 Turku, Finland 2003 320 331