Codeterministic Lindenmayer schemes and systems

DOI10.1016/0022-0000(79)90029-1zbMath0434.68058OpenAlexW2054981102MaRDI QIDQ1139944

Tom Head

Publication date: 1979

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(79)90029-1

zbMATH Keywords

Lindenmayer systemstransducerdecidability result

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Transductions and the parallel generation of languages^† ⋮ A-transducers and the monotonicity of IL schemes ⋮ Restricted use of the splicing operation¹

Cites Work

• Ambiguity in the developmental systems of Lindenmayer
• Single-valued a-transducers
• L systems
• Description of developmental languages using recurrence systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Codeterministic Lindenmayer schemes and systems