A proof of regularity for finite splicing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2950, Issue , 2004, Pages 309-317

  Manca, Vincenzo ^a  

^a UNIVERSITY OF VERONA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

FINITE SET; H SYSTEMS;

ARTIFICIAL INTELLIGENCE;

EID: 33646197931     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (11)

1. Culik II K., Harju T., The regularity of splicing systems and DNA, in Proc. ICALP 1989, LNCS 372, pp. 222-233, 1989.
2. Culik II K., Harju T., Splicing semigroups of dominoes and DNA, Discrete Applied Mathematics, 31, pp. 261-277, 1991.
3. Garret R.H., Grisham C.M., Biochemistry, Saunders College Publishing, Harcourt, 1997.
4. Head T., Formal language theory and DNA: an analysis of the generative capacity of recombinant behaviors, Bulletin of Mathematical Biology, 49, pp. 737-759, 1987.
5. Head T., Pǎun G., Pixton D., Language theory and molecular genetics, Chapter 7 in: [11], pp. 295-360, 1997.
6. Manca V., Splicing normalization and regularity, in: C. Calude, Gh. Pǎun, eds., Finite versus Infinite. Contributions to an Eternal Dilemma, Springer-Verlag, London, 2000.
7. Manca V., On some forms of splicing, in: C. Martin-Vide, V. Mitrana eds., Words, Sequences, Grammars, Languages: Where Biology, Computer Science, Linguistics and Mathematics Meet, Kluwer, Dordrecht, 2000.
8. Pǎun G., Rozenberg G., Salomaa A., DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, 1998.
9. Pixton D., Regularity of splicing languages, Discrete Applied Mathematics (69)1-2, pp. 101-124, 1996.
10. Pixton D., Splicing in abstract families of languages, Theoretical Computer Science, 234:135-166, 2000.
11. Rozenberg G., Salomaa A. (eds.), Handbook of Formal Languages, 3 Vols., Springer-Verlag, Berlin, Heidelberg, 1997.