Linear graph grammars power and complexity

Authors:
Joost Engelfriet;George Leih
Affiliations:
-;-
Venue:
Information and Computation
Year:
1989

Citing 0
Cited 4

Hypergraph languages of bounded degree

Journal of Computer and System Sciences
The complexity of the Kn,n-problem for node replacement graph languages

Information and Computation
Finite graph automata for linear and boundary graph languages

Theoretical Computer Science
On the structure of linear apex NLC graph grammars

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract