Quasi-deterministic 0L systems

DOI10.1007/3-540-55719-9_64zbMath1425.68223OpenAlexW2189522047MaRDI QIDQ5204307

Taishin Y. Nishida

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_64

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Slender 0L languages ⋮ Quasi-deterministic 0L systems and their representation

Cites Work

• Quasi-deterministic 0L systems and their representation
• Repeatable words for substitution
• L systems
• Simplifications of homomorphisms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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