Quasi-deterministic 0L systems and their representation

DOI10.1016/0304-3975(94)00250-MzbMath0873.68119OpenAlexW2040044787MaRDI QIDQ672456

Taishin Y. Nishida

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00250-m

zbMATH Keywords

0L system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Slender 0L languages ⋮ Quasi-deterministic 0L systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Periodicity and ultimate periodicity of D0L systems
• Repeatable words for substitution
• Ambiguity in the developmental systems of Lindenmayer
• Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems
• Description of developmental languages using recurrence systems
• Simplifications of homomorphisms
• Quasi-deterministic 0L systems

This page was built for publication: Quasi-deterministic 0L systems and their representation