Codeterministic Lindenmayer schemes and systems

DOI10.1016/0022-0000(79)90029-1MaRDI QIDQ1139944zbMATH OpenOpenAlexFDO

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

• scientific article; zbMATH DE number 3669879 (Why is no real title available?)
• scientific article; zbMATH DE number 3459899 (Why is no real title available?)
• scientific article; zbMATH DE number 3509706 (Why is no real title available?)
• scientific article; zbMATH DE number 3540642 (Why is no real title available?)
• scientific article; zbMATH DE number 3576711 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Ambiguity in the developmental systems of Lindenmayer
• Description of developmental languages using recurrence systems
• L systems
• Single-valued a-transducers

Cited in

(3)

• Restricted use of the splicing operation¹
• Transductions and the parallel generation of languages^†
• 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)