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

DOI10.1016/S0166-218X(99)00057-8MaRDI QIDQ1304479zbMATH OpenOpenAlexWikidataFDO

Authors Jürgen Dassow, Gheorghe Păun

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

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

Recommendations

• A remark on evolutionary systems
• A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS
• Regular patterns, regular languages and context-free languages
• scientific article; zbMATH DE number 1355188
• scientific article; zbMATH DE number 58377

Cites work

• Bounded Regular Sets
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3767067 (Why is no real title available?)

Cited in

(11)

• A remark on evolutionary systems
• Evolution and observation -- a non-standard way to generate formal languages
• Computational complexity of synchronization under sparse regular constraints
• Computing with viruses
• scientific article; zbMATH DE number 1947340 (Why is no real title available?)
• scientific article; zbMATH DE number 1408343 (Why is no real title available?)
• (Tissue) P systems with vesicles of multisets
• Metric-Driven Grammars and Morphogenesis (Extended Abstract)
• Machines, Computations, and Universality
• Operations and language generating devices suggested by the genome evolution
• On the Non-uniform Redundancy of Representations for Grammatical Evolution: The Influence of Grammars

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304479)