Graph grammars with path-controlled embedding

DOI10.1016/0304-3975(91)90079-HzbMath0742.68036MaRDI QIDQ1177180

Akira Nakamura, Kunio Aizawa

Publication date: 26 June 1992

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (2)

Path-controlled graph grammars for multiresolution image processing and analysis ⋮ Graph grammars according to the type of input and manipulated data: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a relationship between graph L-systems and picture languages
• On the structure of node-label-controlled graph languages
• Restrictions, extensions, and variations of NLC grammars
• Graph grammars with neighbourhood-controlled embedding
• Node-label controlled graph grammars with context conditions
• Tessellation graph characterization using rosettas

This page was built for publication: Graph grammars with path-controlled embedding