PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†

DOI10.1080/03081077608934737MaRDI QIDQ4098668zbMATH OpenOpenAlexFDO

Authors Karel II Culik, Aristid Lindenmayer

Publication date 1976

Published in International Journal of General Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081077608934737

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General biology and biomathematics (92B05) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3480114 (Why is no real title available?)
• scientific article; zbMATH DE number 3497887 (Why is no real title available?)
• scientific article; zbMATH DE number 3338162 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Closure properties of some families of languages associated with biological systems
• Description of developmental languages using recurrence systems
• Nonterminals, homomorphisms and codings in different variations of OL- systems. II: Nondeterministic systems
• Tessellation Automata
• The unsolvability of the equality problem for sentential forms of context-free grammars

Cited in

(7)

• EOL and ETOL array languages
• Table matrix L systems
• On the generative power of sequential and parallel programmed graph grammars
• GROWING CELLULAR SYSTEMS: GENERATION OF GRAPHS BY PARALLEL REWRITING
• Normal form of extended table matrix L systems
• String representations of graphs
• Parallel coherent graph transformations

This page was built for publication: PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†

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