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

DOI10.1016/S0166-218X(99)00057-8zbMath0936.68059OpenAlexW1991188975WikidataQ127389628 ScholiaQ127389628MaRDI QIDQ1304479

Gheorghe Păun, Juergen Dassow

Publication date: 22 September 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00057-8

zbMATH Keywords

context-free evolutionary grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (4)

Computing with viruses ⋮ Computational complexity of synchronization under sparse regular constraints ⋮ Unnamed Item ⋮ Operations and language generating devices suggested by the genome evolution

Cites Work

• Bounded Regular Sets
• Unnamed Item
• Unnamed Item

This page was built for publication: On the regularity of languages generated by context-free evolutionary grammars