论文信息 - On the Regularity of Languages Generated by Context-free Evolutionary Grammars

On the Regularity of Languages Generated by Context-free Evolutionary Grammars

Abstract We show that there is a regular language which cannot be generated by context-free evolutionary grammars, thus disproving a conjecture from Dassow et al. (BioSystems 43 (1997) 169–177). However, all regular languages which are strictly bounded can be generated by context-free evolutionary grammars.

Gheorghe Paun | Jürgen Dassow | G. Paun | J. Dassow

[1] Seymour Ginsburg,et al. BOUNDED REGULAR SETS , 1966 .

[2] Victor Mitrana,et al. Evolutionary Grammars: A Granunatical Model for Genome Evolution , 1996, German Conference on Bioinformatics.

[3] J Dassow,et al. Context-free evolutionary grammars and the structural language of nucleic acids. , 1997, Bio Systems.

[4] M. W. Shields. An Introduction to Automata Theory , 1988 .

[5] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[6] Arto Salomaa. Jewels of formal language theory , 1981 .