Linear splicing and syntactic monoid

Discrete Applied Mathematics

Volumn 154, Issue 3, 2006, Pages 452-470

  Bonizzoni, P ^a   De Felice, C ^b   Mauri, G ^a   Zizza, R ^b  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

Automata; Molecular computing; Regular languages

Indexed keywords

ALGORITHMS; DNA; ENZYME KINETICS; FORMAL LANGUAGES;

FINITE PAUN LINEAR SPLICING SYSTEM; LIGASE ENZYMES; SPLICING SYSTEMS;

LINEAR SYSTEMS;

EID: 32144450963     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.06.008     Document Type: Article

References (23)

1. J. Berstel, and D. Perrin Theory of Codes 1985 Academic Press New York
2. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, Decision problems on linear and circular splicing, in: M. Ito, M. Toyama (Eds.), Proceedings of DLT 2002, Lecture Notes in Computer Science, vol. 2450, Springer, Berlin, 2003, pp. 78-92.
3. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, Regular languages generated by reflexive finite linear splicing systems, Proceedings of DLT 2003, Lecture Notes in Computer Science, vol. 2710, Springer, Berlin, 2003, pp. 134-145.
4. P. Bonizzoni, C. De Felice, G. Mauri, and R. Zizza Circular splicing and regularity Theoret. Inform. Appl. 38 2004 189 228
5. P. Bonizzoni, C. De Felice, and R. Zizza The structure of reflexive regular splicing languages via Schützenberger constants Theoret. Comput. Sci. 334 2005 71 98
6. K. Culik, and T. Harju Splicing semigroups of dominoes and DNA Discrete Appl. Math. 31 1991 261 277
7. A. de Luca, and A. Restivo A characterization of strictly locally testable languages and its applications to subsemigroups of a free semigroup Inform. and Control 44 1980 300 319
8. S. Eilenberg Automata, Languages and Machines vol. A 1974 Academic Press New York
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 publications (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 Singapore
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 Computational modeling for genetic splicing systems SIAM J. Comput. 26 1997 1284 1309
17. R. McNaughton, and S. Papert Counter-Free Automata 1971 MIT Press Cambridge, MA
18. G. Paun On the splicing operation Discrete Appl. Math. 70 1996 57 79
19. G. Paun, G. Rozenberg, and A. Salomaa DNA computing, New Computing Paradigms 1998 Springer Berlin
20. D. Perrin Finite automata J. Van Leeuwen Handbook of Theoretical Computer Science vol. B 1990 Elsevier Amsterdam 1 57
21. J.-E. Pin Variétés de langages formels 1984 Masson Paris (English translation: Varieties of formal languages, Plenum, New-York, 1986)
22. D. Pixton Regularity of splicing languages Discrete Appl. Math. 69 1996 101 124
23. M.P. Schützenberger Sur certaines opérations de fermeture dans les langages rationnels Sympos. Math. 15 1975 245 253