On the regularity of languages generated by context-free evolutionary grammars

Discrete Applied Mathematics

Volumn 92, Issue 2-3, 1999, Pages 205-209

  Dassow, Jürgen ^a   Pǎun, Gheorghe ^b  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

^b INSTITUTE OF MATHEMATICS   (Romania)

Author keywords

Bounded languages; Evolutionary grammars; Languages

Indexed keywords

EID: 0006972036     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00057-8     Document Type: Article

References (6)

1. J. Dassow, V. Mitrana, Evolutionary grammars: a grammatical model for genome evolution, in: R. Hofestädt et al. (Eds.), Bioinformatics, Proceedings of the German Conference on Bioinformatics, Lecture Notes in Computer Science 1278, Springer, Berlin, 1997, pp. 199-209.
2. J. Dassow, V. Mitrana, A. Salomaa, Context-free evolutionary grammars and the structural language of nucleic acids, BioSystems 43 (1997) 169-177.
3. S. Ginsburg, E.H. Spanier, Bounded regular sets, Proc. Amer. Math. Soc. 17 (1966) 1043-1049.
4. J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.
5. A. Salomaa, Jewels of Formal Languages, Computer Science Press, Rockville, 1981.
6. A. Thue, Uber unendliche Zeitchenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania 7 (1906) 1-22.