Locality and the Complexity of Minimalist Derivation Tree Languages

Minimalist grammars provide a formalization of Minimalist syntax which allows us to study how the components of said theory affect its expressivity. A central concern of Minimalist syntax is the locality of the displacement operation Move. In Minimalist grammars, however, Move is unbounded. This paper is a study of the repercussions of limiting movement with respect to the number of slices a moved constituent is allowed to cross, where a slice is the derivation tree equivalent of the phrase projected by a lexical item in the derived tree. I show that this locality condition 1) has no effect on weak generative capacity 2) has no effect on a Minimalist derivation tree language's recognizability by top-down automata 3) renders Minimalist derivation tree languages strictly locally testable, whereas their unrestricted counterparts aren't even locally threshold testable.

[1]  Jorge Calera-Rubio,et al.  Parsing with probabilistic strictly locally testable tree languages , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Thomas Graf,et al.  Closure Properties of Minimalist Derivation Tree Languages , 2011, LACL.

[3]  Edward P. Stabler,et al.  Structural similarity within and among languages , 2003, Theor. Comput. Sci..

[4]  Ferenc Gécseg,et al.  Tree Automata , 2015, ArXiv.

[5]  Thomas Mainguy.  A probabilistic top-down parser for minimalist grammars , 2010, ArXiv.

[6]  Jens Michaelis,et al.  Derivational Minimalism Is Mildly Context-Sensitive , 1998, LACL.

[7]  Edward P. Stabler,et al.  Top-Down Recognizers for MCFGs and MGs , 2011, CMCL@ACL.

[8]  Jens Michaelis,et al.  Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars , 2001, LACL.

[9]  Noam Chomsky,et al.  The Minimalist Program , 1992 .

[10]  Gregory M. Kobele,et al.  An Automata-Theoretic Approach to Minimalism , 2007 .

[11]  Frank Neven,et al.  Static analysis of xml transformation and schema languages , 2006 .

[12]  Thomas Schwentick,et al.  Deterministic top-down tree automata: past, present, and future , 2008, Logic and Automata.

[13]  Edward P. Stabler,et al.  Derivational Minimalism , 1996, LACL.

[14]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[15]  Michael Benedikt,et al.  Regular tree languages definable in FO and in FOmod , 2009, TOCL.

[16]  Gregory M. Kobele,et al.  Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages , 2011, LACL.

[17]  Edward P. Stabler,et al.  Computational Perspectives on Minimalism , 2011 .

[18]  Henk Harkema,et al.  A Characterization of Minimalist Languages , 2001, LACL.

[19]  Arthur Stepanov,et al.  The End of CED? Minimalism and Extraction Domains , 2007 .

[20]  Andreas Podelski,et al.  Minimal Ascending and Descending Tree Automata , 1997, SIAM J. Comput..

[21]  Grzegorz Rozenberg,et al.  Handbook of Formal Languages , 1997, Springer Berlin Heidelberg.

[22]  Wolfgang Thomas,et al.  Regular Tree Languages Without Unary Symbols are Star-Free , 1993, FCT.

[23]  Krishnendu Chatterjee,et al.  Finitary winning in ω-regular games , 2009, TOCL.

[24]  Tadao Kasami,et al.  On Multiple Context-Free Grammars , 1991, Theor. Comput. Sci..

[25]  Hans-Peter Kolb,et al.  An operational and denotational approach to non-context-freeness , 2003, Theor. Comput. Sci..