Codeterministic Lindenmayer schemes and systems

DOI10.1016/0022-0000(79)90029-1zbMATH Open0434.68058OpenAlexW2054981102MaRDI QIDQ1139944FDOQ1139944

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Description of developmental languages using recurrence systems
• Title not available (Why is that?)
• Ambiguity in the developmental systems of Lindenmayer
• Single-valued a-transducers
• Title not available (Why is that?)
• L systems
• Title not available (Why is that?)

Cited In (3)

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

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

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