Abstract
In the present paper, we study the nonterminal complexity of one-sided random context grammars. More specifically, we prove that every recursively enumerable language can be generated by a one-sided random context grammar with no more than ten nonterminals. An analogical result holds for thirteen nonterminals in terms of these grammars with the set of left random context rules coinciding with the set of right random context rules. Furthermore, we introduce the notion of a right random context nonterminal, defined as a nonterminal that appears on the left-hand side of a right random context rule. We demonstrate how to convert any one-sided random context grammar G to an equivalent one-sided random context grammar H with two right random context nonterminals. An analogical conversion is given in terms of (1) propagating one-sided random context grammars and (2) left random context nonterminals. In the conclusion, two open problems are stated.
Similar content being viewed by others
References
Csuhaj-Varjú E., Vaszil G.: Scattered context grammars generate any recursively enumerable language with two nonterminals. Inf. Process. Lett. 110, 902–907 (2010)
Czeizler E., Czeizler E., Kari L., Salomaa K.: On the descriptional complexity of Watson–Crick automata. Theor Comput Sci 410(35), 3250–3260 (2009)
Dassow J., Păun G.: Regulated Rewriting in Formal Language Theory. Springer, New York, NY (1989)
Fernau H.: Nonterminal complexity of programmed grammars. Theor. Comput. Sci. 296(2), 225–251 (2003)
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)
Fernau H., Meduna A.: A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. Inf. Process. Lett. 86(5), 235–240 (2003)
Geffert V.: Normal forms for phrase-structure grammars. Theor. Inf. Appl. 25(5), 473–496 (1991)
Holzer, M., Kutrib, M.: Nondeterministic finite automata—recent results on the descriptional and computational complexity. In: Implementation and Applications of Automata, Lecture Notes in Computer Science, vol. 5148, pp. 1–16. Springer (2008)
Madhu M.: Descriptional complexity of rewriting P systems. J. Autom. Lang. Comb. 9(2–3), 311–316 (2004)
Martín-Vide, C., Mitrana, V., Păun, G. (eds.): Formal Languages and Applications, chap. 13. pp. 249–274. Springer Berlin (2004)
Masopust T.: Descriptional complexity of multi-parallel grammars. Inf. Process. Lett. 108(2), 68–70 (2008)
Masopust T.: On the descriptional complexity of scattered context grammars. Theor. Comput. Sci. 410(1), 108–112 (2009)
Masopust T., Meduna A.: On descriptional complexity of partially parallel grammars. Fundamenta Informaticae 87(3), 407–415 (2008)
Masopust, T., Meduna, A.: Descriptional complexity of three-nonterminal scattered context grammars: an improvement. In: Proceedings of 11th International Workshop on Descriptional Complexity of Formal Systems, pp. 235–245. Otto-von-Guericke-Universität Magdeburg (2009)
Meduna A.: Automata and Languages: Theory and Applications. Springer, London (2000)
Meduna A., Zemek P.: One-sided random context grammars. Acta Informatica 48(3), 149–163 (2011)
Okubo F.: A note on the descriptional complexity of semi-conditional grammars. Inf. Process. Lett. 110(1), 36–40 (2009)
Rozenberg, G., Salomaa, A. (eds): Handbook of Formal Languages, vol. 1–3. Springer, Berlin (1997)
Vaszil G.: On the descriptional complexity of some rewriting mechanisms regulated by context conditions. Theor. Comput. Sci. 330(2), 361–373 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Meduna, A., Zemek, P. Nonterminal complexity of one-sided random context grammars. Acta Informatica 49, 55–68 (2012). https://doi.org/10.1007/s00236-012-0150-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00236-012-0150-6