Characteristics of graph languages generated by edge replacement

DOI10.1016/0304-3975(87)90050-8zbMath0636.68100OpenAlexW2004996495MaRDI QIDQ1098320

Annegret Habel, Hans-Joerg Kreowski

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90050-8

zbMATH Keywords

fixed pointsgraph grammarsgraph languagesEdge replacement systems

Mathematics Subject Classification ID

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

Related Items

Handle NLC grammars and r. e. languages, Recursively defined tree transductions, Metatheorems for decision problems on hyperedge replacement graph languages, Graph-theoretic properties compatible with graph derivations, Boundary graph grammars with dynamic edge relabeling, Hypermap rewriting: A combinatorial approach, On structured graph grammars. II, Unnamed Item, On structured graph grammars. I, On hyperedge replacement and BNLC graph grammars

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of node-label-controlled graph languages
• Decision problems for node label controlled graph grammars
• Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
• A characterization of context-free languages
• Pair grammars, graph languages and string-to-graph translations
• On certain formal properties of grammars
• Context-free graph grammars
• Two Families of Languages Related to ALGOL
• Cap expressions for context-free languages
• Transition network grammars for natural language analysis