Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt. Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars. Journal of Automata, Languages and Combinatorics, 12(1-2):117-138, 2007.
@article{FernauFOR07,
title = {Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars},
author = {Henning Fernau and Rudolf Freund and Marion Oswald and Klaus Reinhardt},
year = {2007},
tags = {graph-rewriting, rewriting, grammar},
researchr = {https://researchr.org/publication/FernauFOR07},
cites = {0},
citedby = {0},
journal = {Journal of Automata, Languages and Combinatorics},
volume = {12},
number = {1-2},
pages = {117-138},
}