The Copying Power of Well-Nested Multiple Context-Free Grammars

We prove a copying theorem for well-nested multiple context-free languages: if L={ w # w |w∈L0 } has a well-nested m-MCFG, then L has a ‘non-branching' well-nested m-MCFG. This can be used to give simple examples of multiple context-free languages that are not generated by any well-nested MCFGs.

[1]  Giorgio Satta,et al.  Independent Parallelism in Finite Copying Parallel Rewriting Systems , 1999, Theor. Comput. Sci..

[2]  Brigitte Rozoy.  The Dyck Language D'_1^* Is Not Generated by Any Matric Grammar of Finite Index , 1987, Inf. Comput..

[3]  Joost Engelfriet,et al.  Copying Theorems , 1976, Information Processing Letters.

[4]  Günter Hotz,et al.  On Parsing Coupled-Context-Free Languages , 1996, Theor. Comput. Sci..

[5]  Makoto Kanazawa.  The Pumping Lemma for Well-Nested Multiple Context-Free Languages , 2009, Developments in Language Theory.

[6]  Jens Michaelis.  An Additional Observation on Strict Derivational Minimalism , 2009 .

[7]  Daniel Götzmann.  Multiple Context-Free Grammars , 2007 .

[8]  David R. Dowty,et al.  Natural Language Parsing: Psychological, Computational, and Theoretical Perspectives , 1985 .

[9]  Giorgio Satta,et al.  Trading Independent for Synchronized Parallelism in Finite Copying Parallel Rewriting Systems , 1998, J. Comput. Syst. Sci..

[10]  Peter Staudacher,et al.  New Frontiers Beyond Context-Freeness: Di-Grammars and Di-Automata. , 1993, EACL.

[11]  Michael J. Fischer,et al.  Grammars with Macro-Like Productions , 1968, SWAT.

[12]  Andrzej Ehrenfeucht,et al.  On Some Context Free Languages That Are Not Deterministic ETOL Languages , 1977, RAIRO Theor. Informatics Appl..

[13]  Joost Engelfriet,et al.  Tree transducers, L systems and two-way machines (Extended Abstract) , 1978, J. Comput. Syst. Sci..

[14]  Masami Ito,et al.  Context-free languages consisting of non-primitive words , 1991, Int. J. Comput. Math..

[15]  Jeffrey Shallit,et al.  A Second Course in Formal Languages and Automata Theory , 2008 .

[16]  Takeshi Hayashi.  On Derivation Trees of Indexed Grammars —An Extension of the uvwxy-Theorem— , 1973 .

[17]  Marco Kuhlmann,et al.  Dependency structures and lexicalized grammars , 2007 .

[18]  Max Dauchet,et al.  Un Théorème de Duplication pour les Forêts Algébriques , 1976, J. Comput. Syst. Sci..

[19]  Hiroyuki Seki,et al.  On the Generative Power of Multiple Context-Free Grammars and Macro Grammars , 2008, IEICE Trans. Inf. Syst..

[20]  Aravind K. Joshi,et al.  Natural language parsing: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? , 1985 .

[21]  David J. Weir,et al.  Characterizing Structural Descriptions Produced by Various Grammatical Formalisms , 1987, ACL.