The bounded degree problem for eNCE graph grammars
From MaRDI portal
Publication:1363781
DOI10.1006/inco.1997.2628zbMath0879.68069OpenAlexW2064200333MaRDI QIDQ1363781
Konstantin Skodinis, Egon Wanke
Publication date: 11 August 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1997.2628
Related Items (3)
Node replacements in embedding normal form. ⋮ Finite graph automata for linear and boundary graph languages ⋮ The complexity of the \(K_{n,n}\)-problem for node replacement graph languages
Cites Work
- Unnamed Item
- Unnamed Item
- The bounded degree problem for NLC grammars is decidable
- Hyperedge replacement: grammars and languages
- Boundary graph grammars with dynamic edge relabeling
- A comparison of boundary graph grammars and context-free hypergraph grammars
- On the structure of node-label-controlled graph languages
- Restrictions, extensions, and variations of NLC grammars
- Linear graph grammars: Power and complexity
- Structural properties of context-free sets of graphs generated by vertex replacement
- Emptiness problems of eNCE graph languages
- The complexity of graph languages generated by hyperedge replacement
- Handle-rewriting hypergraph grammars
- Complexity of boundary graph languages
- Boundary NLC graph grammars—Basic definitions, normal forms, and complexity
- Languages that Capture Complexity Classes
- The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
This page was built for publication: The bounded degree problem for eNCE graph grammars
