Abstract:
The complexity of the bounded degree problem is analyzed for graph languages generated by eNCE graph grammars. In particular, the bounded degree problem is shown to be undecidable for eNCE graph grammars, DEXPTIME-complete for confluent/boundary eNCE graph grammars, PSPACE-complete for linear eNCE graph grammars, and P-complete for non-blocking eNCE graph grammars. In our main theorem we show that the bounded degree problem is NL-complete for reduced nonblocking eNCE graph grammars. Many of the shown results carry over to other types of graph grammars. 1 Introduction and
Citations
|
2869
|
Introduction to Automata Theory, Languages and Computation
– Hopcroft, Ullman
- 1979
|
|
243
|
Languages that capture complexity classes
– Immerman
- 1987
|
|
60
|
Handle-rewriting hypergraph grammars
– Courcelle, Engelfriet, et al.
- 1993
|
|
32
|
Hyperedge Replacement: Grammars and Languages”, volume 643
– Habel
- 1992
|
|
19
|
On the structure of node label controlled graph languages
– Janssens, Rozenberg
- 1980
|
|
13
|
Restrictions, extensions, and variations of NLC grammars
– Janssens, Rozenberg
- 1980
|
|
12
|
Structural properties of context-free sets of graphs generated by vertex replacement
– Courcelle
- 1995
|
|
11
|
Boundary graph grammars with dynamic edge relabeling
– Engelfriet, Leih, et al.
- 1990
|
|
9
|
A comparison of boundary graph grammars and context-free hypergraph grammars
– Engelfriet, Rozenberg
- 1990
|
|
8
|
Practical applications of precedence graph grammars”, Graph Grammars and their application to Computer
– Kaul
- 1987
|
|
7
|
On partially ordered graph grammars
– Brandenburg
- 1987
|
|
7
|
The complexity of graph languages generated by hyperedge replacement
– Lautemann
- 1990
|
|
6
|
Linear graph grammars: power and complexity
– Engelfriet, Leih
- 1989
|
|
5
|
Syntaxanalyse von Graphen bei Prazedenz-Graphgrammatiken
– Kaul
- 1985
|
|
4
|
The bounded degree problem for NLC graph grammars is decidable
– Janssens, Rozenberg, et al.
- 1986
|
|
3
|
Complexity of boundary graph languages
– Engelfriet, Leih
- 1990
|
|
3
|
On the computational complexity of some decidable problems for EOL systems and BSTA
– Monti, Roncato
- 1993
|
|
3
|
Boundary NLC graph grammars---basic definitions, normal forms, and complexity
– Rozenberg, Welzl
- 1986
|
|
3
|
Emptiness problems of eNCE graph languages
– Skodinis, Wanke
- 1995
|
|
2
|
The equivalence of boundary and confluent graph grammars on graph languages of bounded degree
– Brandenburg
- 1991
|
|
