LATA 2016: Language and Automata Theory and Applications pp 371-383 | Cite as
Ogden’s Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy
Abstract
I present a simple example of a multiple context-free language for which a very weak variant of generalized Ogden’s lemma fails. This language is generated by a non-branching (and hence well-nested) 3-MCFG as well as by a (non-well-nested) binary-branching 2-MCFG; it follows that neither the class of well-nested 3-MCFLs nor the class of 2-MCFLs is included in Weir’s control language hierarchy, for which Palis and Shende proved an Ogden-like iteration theorem. I then give a simple sufficient condition for an MCFG to satisfy a natural analogue of Ogden’s lemma, and show that the corresponding class of languages is a substitution-closed full AFL which includes Weir’s control language hierarchy. My variant of generalized Ogden’s lemma is incomparable in strength to Palis and Shende’s variant and is arguably a more natural generalization of Ogden’s original lemma.
Keywords
Grammars Ogden’s lemma Multiple context-free grammars Control languagesReferences
- 1.Engelfriet, J.: Context-free graph grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Beyond Words, vol. 3, pp. 125–213. Springer, Berlin (1997)CrossRefGoogle Scholar
- 2.Ginsburg, S., Spanier, E.H.: AFL with the semilinear property. J. Comput. Syst. Sci. 5(4), 365–396 (1971)CrossRefMathSciNetMATHGoogle Scholar
- 3.Greibach, S.A.: Hierarchy theorems for two-way finite state transducers. Acta Informatica 11, 89–101 (1978)CrossRefMathSciNetMATHGoogle Scholar
- 4.Greibach, S.A.: One-way finite visit automata. Theor. Comput. Sci. 6, 175–221 (1978)CrossRefMathSciNetMATHGoogle Scholar
- 5.Greibach, S.A.: The strong independence of substitution and homomorphic replication. R.A.I.R.O. Informatique théorique 12(3), 213–234 (1978)MathSciNetMATHGoogle Scholar
- 6.Kanazawa, M.: The pumping lemma for well-nested multiple context-free languages. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 312–325. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- 7.Kanazawa, M., Kobele, G.M., Michaelis, J., Salvati, S., Yoshinaka, R.: The failure of the strong pumping lemma for multiple context-free languages. Theor. Comput. Syst. 55(1), 250–278 (2014)CrossRefMathSciNetMATHGoogle Scholar
- 8.Kanazawa, M., Salvati, S.: Generating control languages with abstract categorial grammars. In: Preliminary Proceedings of FG-2007: The 12th Conference on Formal Grammar (2007)Google Scholar
- 9.Kanazawa, M., Salvati, S.: The copying power of well-nested multiple context-free grammars. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 344–355. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 10.Ogden, W.: A helpful result for proving inherent ambiguity. Math. Syst. Theor. 2(3), 191–194 (1968)CrossRefMathSciNetMATHGoogle Scholar
- 11.Palis, M.A., Shende, S.M.: Pumping lemmas for the control language hierarchy. Math. Syst. Theor. 28(3), 199–213 (1995)CrossRefMathSciNetMATHGoogle Scholar
- 12.Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theor. Comput. Sci. 88(2), 191–229 (1991)CrossRefMathSciNetMATHGoogle Scholar
- 13.Weir, D.J.: A geometric hierarchy beyond context-free languages. Theor. Comput. Sci. 104(2), 235–261 (1992)CrossRefMathSciNetMATHGoogle Scholar