On a relationship between graph L-systems and picture languages

DOI10.1016/0304-3975(83)90047-6zbMath0514.68067OpenAlexW1969256644MaRDI QIDQ1051434

Akira Nakamura, Kunio Aizawa

Publication date: 1983

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90047-6

zbMATH Keywords

formal languagesL-systemstwo-dimensional grammarsgraph-grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

Amalgamated graph transformations and their use for specifying AGG — an algebraic graph grammar system ⋮ Parallel high-level replacement systems ⋮ Graph grammars with path-controlled embedding

Cites Work

• Description of developmental languages using recurrence systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a relationship between graph L-systems and picture languages