Author:
Meduna Alexander,Zemek Petr
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Information Systems,Software
Reference19 articles.
1. Csuhaj-Varjú E., Vaszil G.: Scattered context grammars generate any recursively enumerable language with two nonterminals. Inf. Process. Lett. 110, 902–907 (2010)
2. Czeizler E., Czeizler E., Kari L., Salomaa K.: On the descriptional complexity of Watson–Crick automata. Theor Comput Sci 410(35), 3250–3260 (2009)
3. Dassow J., Păun G.: Regulated Rewriting in Formal Language Theory. Springer, New York, NY (1989)
4. Fernau H.: Nonterminal complexity of programmed grammars. Theor. Comput. 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. Automat. Lang. Comb. 12(1–2), 117–138 (2007)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献