On the power of circular splicing

Discrete Applied Mathematics

Volumn 150, Issue 1-3, 2005, Pages 51-66

  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

DNA; FINITE AUTOMATA; LINEAR SYSTEMS; MATHEMATICAL MODELS; SET THEORY;

AUTOMATA; MOLECULAR COMPUTING; SPLICING SYSTEMS;

FORMAL LANGUAGES;

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

References (24)

1. J. Berstel, and D. Perrin Theory of Codes 1985 Academic Press New York
2. J. Berstel, A. Restivo, Codes et sousmonoides fermes par conjugaison, Sem. LITP 81-45 (1981) 10pp.
3. P. Bonizzoni, C. De Felice, G. Mauri, R. Zizza, DNA and circular splicing, in: A. Condon, G. Rozenberg (Eds.), Proceedings DNA 2000, Lecture Notes in Computer Science, vol. 2054, Springer, Berlin, 2001, pp. 117-129.
4. 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.
5. P. Bonizzoni, C. De Felice, G. Mauri, and R. Zizza Circular splicing and regularity Theoret. Informatics Appl. 38 2004 189 228
6. S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, New York, 1974.
7. L. Fuchs Abelian Groups 1960 Pergamon Press Oxford, London, New York and Paris
8. M.H. Harrison Introduction to Formal Language Theory 1978 Addison-Wesley Reading, MA
9. K. Hashiguchi Regular languages of star height one Inform. and Control 53 1982 199 210
10. K. Hashiguchi Limitedness theorem of automata with distance functions J. Comput. System Sci. 24 1982 233 244
11. K. Hashiguchi Representation theorems on regular languages J. Comput. System Sci. 27 1983 101 115
12. K. Hashiguchi Algorithms for determining relative star height and star height Inform. and Comput. 78 1987 124 169
13. T. Head Formal Language Theory and DNA: an analysis of the generative capacity of specific recombinant behaviours Bull. Math. Biol. 49 1987 737 759
14. T. Head, manuscript, also published as Splicing schemes and DNA, in: Lindenmayer Systems: Impacts on Theoretical Computer Science and Developmental Biology, Springer, Berlin, 1992, pp. 371-383.
15. 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
16. J.E. Hopcroft, R. Motwani, and J.D. Ullman Introduction to Automata Theory, Languages, and Computation 2001 Addison-Wesley Reading, MA
17. M. Lothaire Combinatorics on Words, Encyclopedia of Mathematics and its Applications 1983 Addison-Wesley Reading, 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. D. Pixton Regularity of splicing languages Discrete Appl. Math. 69 1996 101 124
22. D. Pixton Splicing in abstract families of languages Theoret. Comput. Sci. 234 2000 135 166
23. C. Reis, and G. Thierren Reflective star languages and codes Inform. and Control 42 1979 1 9
24. R. Siromoney, K.G. Subramanian, A. Dare, Circular DNA and Splicing Systems, in: Proc. of ICPIA, Lecture Notes in Computer Science, vol. 654, Springer, Berlin, 1985, pp. 260-273.