PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†
From MaRDI portal
Publication:4098668
DOI10.1080/03081077608934737zbMath0332.68054OpenAlexW2050723398MaRDI QIDQ4098668
Aristid Lindenmayer, Karel II Culik
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
Formal languages and automata (68Q45) General biology and biomathematics (92B05) Algorithms in computer science (68W99)
Related Items (7)
EOL and ETOL array languages ⋮ On the generative power of sequential and parallel programmed graph grammars ⋮ Parallel coherent graph transformations ⋮ GROWING CELLULAR SYSTEMS: GENERATION OF GRAPHS BY PARALLEL REWRITING ⋮ String representations of graphs ⋮ Normal form of extended table matrix L systems ⋮ Table matrix L systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonterminals, homomorphisms and codings in different variations of OL- systems. II: Nondeterministic systems
- The unsolvability of the equality problem for sentential forms of context-free grammars
- Description of developmental languages using recurrence systems
- Closure properties of some families of languages associated with biological systems
- Tessellation Automata
This page was built for publication: PARALLEL GRAPH GENERATING AND GRAPH RECURRENCE SYSTEMS FOR MULTICELLULAR DEVELOPMENT†
