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.
M. Kanazawa—This work was supported by JSPS KAKENHI Grant Number 25330020.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Non-branching MCFGs have been called linear in [1].
- 2.
The language L in the proof of Theorem 6 was inspired by Lemma 5.4 of Greibach [5], where a much more complicated language was used to show that the range of a deterministic two-way finite-state transducer need not be strongly iterative. One can see that the language Greibach used is an \(\text {8-MCFL}(1)\). In her proof, Greibach essentially relied on a stronger requirement imposed by her notion of strong iterativity, namely that in the factorization \(z = u_1 v_1 \dots u_k v_k u_{k+1}\), there must be some i such that \(u_i\) and \(u_{i+1}\) contain at least one distinguished position and \(v_i\) contains at least two distinguished positions. Strong iterativity is not implied by the condition in Theorem 5, so Greibach’s lemma fell short of providing an example of a language in \(\bigcup _m m\text {-MCFL}(1)\) that does not belong to Weir’s hierarchy.
References
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)
Ginsburg, S., Spanier, E.H.: AFL with the semilinear property. J. Comput. Syst. Sci. 5(4), 365–396 (1971)
Greibach, S.A.: Hierarchy theorems for two-way finite state transducers. Acta Informatica 11, 89–101 (1978)
Greibach, S.A.: One-way finite visit automata. Theor. Comput. Sci. 6, 175–221 (1978)
Greibach, S.A.: The strong independence of substitution and homomorphic replication. R.A.I.R.O. Informatique théorique 12(3), 213–234 (1978)
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)
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)
Kanazawa, M., Salvati, S.: Generating control languages with abstract categorial grammars. In: Preliminary Proceedings of FG-2007: The 12th Conference on Formal Grammar (2007)
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)
Ogden, W.: A helpful result for proving inherent ambiguity. Math. Syst. Theor. 2(3), 191–194 (1968)
Palis, M.A., Shende, S.M.: Pumping lemmas for the control language hierarchy. Math. Syst. Theor. 28(3), 199–213 (1995)
Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theor. Comput. Sci. 88(2), 191–229 (1991)
Weir, D.J.: A geometric hierarchy beyond context-free languages. Theor. Comput. Sci. 104(2), 235–261 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Kanazawa, M. (2016). Ogden’s Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy. In: Dediu, AH., Janoušek, J., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2016. Lecture Notes in Computer Science(), vol 9618. Springer, Cham. https://doi.org/10.1007/978-3-319-30000-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-30000-9_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29999-0
Online ISBN: 978-3-319-30000-9
eBook Packages: Computer ScienceComputer Science (R0)