Abstract
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is pumpable at some 2m substrings. We prove a pumping lemma of the usual universal form for the subclass consisting of well-nested multiple context-free languages. This is the same class of languages generated by non-duplicating macro grammars and by coupled-context-free grammars.
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
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Löding, C., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, October 12 (2007), http://tata.gforge.inria.fr/
Engelfriet, J., Heyker, L.: The string generating power of context-free hypergraph grammars. Journa of Computer and System Sciences 43, 328–360 (1991)
Fisher, M.J.: Grammars with Macro-Like Productions. Ph.D. thesis, Harvard University (1968)
Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Beyond Words, vol. 3, pp. 1–68. Springer, Berlin (1997)
Groenink, A.: Surface without Structure. Ph.D. thesis, Utrecht University (1997)
Hotz, G., Pitsch, G.: On parsing coupled-context-free languages. Thoretical Computer Science 161, 205–253 (1996)
Joshi, A.K., Schabes, Y.: Tree-adjoining grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Beyond Words, vol. 3, pp. 69–123. Springer, Berlin (1997)
Kanazawa, M., Salvati, S.: Generating control languages with abstract categorial grammars. In: The preliminary proceedings of FG-2007: The 12th Conference on Formal Grammar (2007)
Kepser, S., Mönnich, U.: Closure properties of linear context-free tree languages with an application to optimality theory. Theoretical Computer Science 354(1), 82–97 (2006)
Kracht, M.: The Mathematics of Language. Mouton de Gruyter, Berlin (2003)
Kuhlman, M., Möhl, M.: Mildly context-sensitive dependency languages. In: Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics, pp. 160–167 (2007a)
Kuhlman, M., Möhl, M.: The string-generative capacity of regular dependency languages. In: FG 2007 (2007b)
Michaelis, J.: An additional observation on strict derivational minimalism. In: Rogers, J. (ed.) Proceedings of FG-MoL 2005: The 10th conference on Formal Grammar and the 9th Meeting on Mathematics of Language, pp. 101–111. CSLI Publications, Stanford (2009)
Michaelis, J., Kracht, M.: Semilinearity as a syntactic invariant. In: Retoré, C. (ed.) Logical Aspects of Computational Linguistics, pp. 329–345. Springer, Berlin (1997)
Palis, M.A., Shende, S.M.: Pumping lemmas for the control language hierarchy. Mathematical Systems Theory 28(3), 199–213 (1995)
Radzinski, D.: Chinese number-names, tree adjoining languages, and mild context-sensitivity. Computational Linguistics 17(3), 277–299 (1991)
Rambow, O., Satta, G.: Independent parallelism in finite copying parallel rewriting systems. Theoretical Computer Science 223, 87–120 (1999)
Seki, H., Kato, Y.: On the generative power of multiple context-free grammars and macro grammars. IEICE Transactions on Information and Systems E91–D(2), 209–221 (2008)
Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88(2), 191–229 (1991)
Smullyan, R.M.: Theory of Formal Systems. Princeton University Press, Princeton (1961)
Staudacher, P.: New frontiers beyond context-freeness: DI-grammars and DI-automata. In: 6th Conference of the European Chapter of the Association for Computational Linguistics (EACL 1993), pp. 358–367 (1993)
Tamaki, H., Sato, T.: Unfold/fold transformation of logic programs. In: Proceedings of the Second International Conference on Logic Programming, pp. 127–138 (1984)
Vijay-Shanker, K., Weir, D.J., Joshi, A.K.: Characterizing structural descriptions produced by various grammatical formalisms. In: 25th Annual Meeting of the Association for Computational Linguistics, pp. 104–111 (1987)
Villemonte de la Clergerie, É.: Parsing MCS languages with thread automata. In: Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+6), pp. 101–108 (2002a)
Villemonte de la Clergerie, É.: Parsing mildly context-sensitive languages with thread automata. In: Proceedings of the 19th International Conference on Computational Linguistics, pp. 1–7 (2002b)
Weir, D.: Linear context-free rewriting systems and deterministic tree-walking transducers. In: Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics, pp. 136–143 (1992)
Weir, D.J.: Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, University of Pennsylvania (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kanazawa, M. (2009). The Pumping Lemma for Well-Nested Multiple Context-Free Languages. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-02737-6_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02736-9
Online ISBN: 978-3-642-02737-6
eBook Packages: Computer ScienceComputer Science (R0)