Hypergraph languages of bounded degree
From MaRDI portal
Publication:1318469
DOI10.1016/S0022-0000(05)80022-4zbMath0802.68073OpenAlexW1984359106MaRDI QIDQ1318469
Joost Engelfriet, Linda Heyker
Publication date: 27 March 1994
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(05)80022-4
Related Items (9)
Monadic second-order definable graph transductions: a survey ⋮ Handle-rewriting hypergraph grammars ⋮ The monadic second order logic of graphs. VI: On several representations of graphs by relational structures ⋮ Context-free graph languages of bounded degree are generated by apex graph grammars ⋮ HRNCE grammars -- a hypergraph generating system with an eNCE way of rewriting ⋮ HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting ⋮ A Greibach normal form for context-free graph grammars ⋮ Unnamed Item ⋮ Generating irregular partitionable data structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperedge replacement: grammars and languages
- Nonterminal separation in graph grammars
- Boundary graph grammars with dynamic edge relabeling
- A comparison of boundary graph grammars and context-free hypergraph grammars
- An axiomatic definition of context-free rewriting and its application to NLC graph grammars
- The string generating power of context-free hypergraph grammars
- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- Linear graph grammars: Power and complexity
- Handle-rewriting hypergraph grammars
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Graph expressions and graph rewritings
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
- A Greibach normal form for context-free graph grammars
This page was built for publication: Hypergraph languages of bounded degree
