Boundary NLC graph grammars--basic definitions, normal forms, and complexity
Information and Control
Theoretical Computer Science
The complexity of searching a graph
Journal of the ACM (JACM)
Apex graph grammars and attribute grammars
Acta Informatica
Efficient solution to connectivity problems on hierarchically defined graphs
SIAM Journal on Computing
Linear graph grammars power and complexity
Information and Computation
Boundary graph grammars with dynamic edge relabeling
Journal of Computer and System Sciences
Introduction to algorithms
A comparison of boundary graph grammars and context-free hypergraph grammars
Information and Computation
Monotonicity in graph searching
Journal of Algorithms
Algorithms for graph problems on BNLC structured graphs
Information and Computation
The vertex separation number of a graph equals its path-width
Information Processing Letters
Recontamination does not help to search a graph
Journal of the ACM (JACM)
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
The vertex separation and search number of a graph
Information and Computation
Recognition of graphs by automata
Theoretical Computer Science
Emptiness problems of eNCE graph languages
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Time-space tradeoffs for undirected graph traversal by graph automata
Information and Computation
The bounded degree problem for eNCE graph grammars
Information and Computation
Handbook of formal languages, vol. 3
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Node replacement graph grammars
Handbook of graph grammars and computing by graph transformation
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Graph Automata for Linear Graph Languages
Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science
On Polynomial Time Graph Grammars
STACS '88 Proceedings of the 5th Annual Symposium on Theoretical Aspects of Computer Science
Graph Grammars Based on Node Rewriting: An Introduction to NLC Graph Grammars
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Context-Free NCE Graph Grammars
FCT '89 Proceedings of the International Conference on Fundamentals of Computation Theory
Graph searching and search time
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Hi-index | 5.23 |
Graph grammars can be regarded as a generalization of context-free grammars from strings to graphs. Over the past 30 years a rich theory of graph grammars and their languages has been developed. However, there are no graph automata. There is no duality between generative and recognizing devices, as it is known for the Chomsky hierarchy of formal languages.Here we introduce graph automata as devices for the recognition of sets of undirected node labelled graphs. A graph automaton consists of a finite state control, a finite set of instructions, and a collection of heads or guards. It reads an input graph in a systematic way and performs a graph search directed by the instructions. As our main results we show that finite graph automata recognize exactly the set of graph languages generated by linear NCE graph grammars and that alternating finite graph automata recognize exactly the languages of boundary graph grammars. Finally, we generalize some automata theoretic properties from string to graph automata, integrate the connectivity of graphs into graph automata, and explain why graph automata cannot be generalized to deal with dynamic edge relabellings and eNCE graph languages.