Abstract
A tree controlled grammar can be given as a pair (G,G′) where G is a context-free grammar and G′ is a regular grammar. Its language consists of all terminal words with a derivation in G such that all levels of the corresponding derivation tree – except the last level – belong to L(G′). We define its descriptional complexity Var(G,G′) as the sum of the numbers of nonterminals of G and G′. In [24] we have shown that tree controlled grammars (G,G′) with Var(G,G′) ≤ 9 are sufficient to generate all recursively enumerable languages. In this paper, our main result improves the bound to seven. Moreover, we show that all linear and regular simple matrix languages can be generated by tree controlled grammars with a descriptional complexity bounded by three.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cremers, A.B., Mayer, O., Weiss, K.: On the complexity of regulated rewriting. Information Control 33, 10–19 (1974)
Csuhaj-Varjú, E., Vaszil, G.: Scattered context grammars generated any recursively enumerable language with two nonterminals. Information Processing Letters 110(20), 902–907 (2010)
Čulik II, K., Maurer, H.: Tree controlled grammars. Computing 19, 129–139 (1977)
Dassow, J.: Remarks on the complexity of regulated rewriting. Fundamenta Informaticae 7, 83–103 (1984)
Dassow, J., Pǎun, G.: Further remarks on the complexity of regulated rewriting. Kybernetika 21, 213–227 (1985)
Dassow, J., Pǎun, G.: Some notes on the complexity of regulated rewriting. Bull. Math. Soc. Sci. Math. R.S. Roumanie 30 (1986)
Dassow, J., Pǎun, G.: Regulated rewriting in formal language theory. Springer, Berlin (1989)
Dassow, J., Stiebe, R., Truthe, B.: Generative capacity of subregularly tree controlled grammars. International Journal of Foundations of Computer Science 21, 723–740 (2010)
Fernau, H.: Nonterminal complexity of programmed grammars. Theoretical Computer Science 296, 225–251 (2003)
Fernau, H., Freund, R., Oswald, M., Reinhardt, K.: Refinding the nonterminal complexity of graph-controlled, programmed, and matrix grammars. Journal of Automata, Languages and Combinatorics 12(1), 117–138 (2007)
Fernau, H., Meduna, A.: On the degree of scattered context-sensitivity. Theoretical Computer Science 290, 2121–2124 (2003)
Fernau, H., Meduna, A.: A simultaneous reduction of several measures of descriptional complexity in scattered context grammars. Information Processing Letters 86, 235–240 (2003)
Geffert, V.: Context-free-like forms for phrase-structure grammars. In: Koubek, V., Janiga, L., Chytil, M.P. (eds.) MFCS 1988. LNCS, vol. 324, pp. 309–317. Springer, Heidelberg (1988)
Gruska, J.: On a classification of context-free languages. Kybernetika 3, 22–29 (1967)
Ibarra, O.: Simple matrix grammars. Inform. Control 17, 359–394 (1970)
Masopust, T.: Descriptional complexity of multi-parallel grammars. Information Processing Letters 108, 68–70 (2008)
Meduna, A.: On the number of nonterminals in matrix grammars with leftmost derivations. In: Păun, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol. 1218, pp. 27–38. Springer, Heidelberg (1997)
Meduna, A.: Generative power of three-nonterminal scattered context grammars. Theoretical Computer Science 246, 279–284 (2000)
Meduna, A., Gopalaratnam, A.: On semi-conditional grammars with productions having either forbidding or permitting conditions. Acta Cybernetica 11(4), 307–323 (1994)
Meduna, A., Švec, M.: Reduction of simple semi-conditional grammars with respect to the number of conditional productions. Acta Cybernetica 15, 353–360 (2002)
Pǎun, G.: On the generative capacity of tree controlled grammars. Computing 21, 213–220 (1979)
Pǎun, G.: Six nonterminals are enough for generating each RE language by a matrix grammar. International Journal of Computional Mathematics 15, 23–37 (1984)
Rozenberg, G., Salomaa, A. (eds.): Handbook of formal languages, vol. I-III. Springer, Berlin (1997)
Turaev, S., Dassow, J., Selamat, M.: Nonterminal complexity of tree controlled grammars. Theoretical Computer Science (submitted, 2011)
Vaszil, G.: On the descriptional complexity of some rewriting mechanisms regulated by context conditions. Theoretical Computer Science 330, 361–373 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Turaev, S., Dassow, J., Selamat, M.H. (2011). Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22600-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-22600-7_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22599-4
Online ISBN: 978-3-642-22600-7
eBook Packages: Computer ScienceComputer Science (R0)