Author:
Meduna Alexander,Zemek Petr
Reference10 articles.
1. Barbaiani, M., Bibire, C., Dassow, J., Delaney, A., Fazekas, S., Ionescu, M., Liu, G., Lodhi, A., Nagy, B.: The power of programmed grammars with graphs from various classes. J. Appl. Math. Comput. 22(1–2), 21–38 (2006)
2. Bordihn, H., Holzer, M.: Programmed grammars and their relation to the LBA problem. Acta Informatica 43(4), 223–242 (2006)
3. Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, New York (1989)
4. Fernau, H.: Nonterminal complexity of programmed grammars. Theor. Comp. Sci. 296(2), 225–251 (2003)
5. Fernau, H., Freund, R., Oswald, M., Reinhardt, K.: Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars. J. Autom. Lang. Combin. 12(1–2), 117–138 (2007)