The complexity of the Kn,n-problem for node replacement graph languages
Information and Computation
Normal forms for context-free node-rewriting hypergraph grammars
Mathematical Structures in Computer Science
Finite graph automata for linear and boundary graph languages
Theoretical Computer Science
Hi-index | 0.00 |