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
Quasi-rocking real-time pushdown automata
Theoretical Computer Science
On the structure of linear apex NLC graph grammars
Theoretical Computer Science
Hi-index | 0.00 |