On multiple context-free grammars
Theoretical Computer Science
Minimal Ascending and Descending Tree Automata
SIAM Journal on Computing
Languages, automata, and logic
Handbook of formal languages, vol. 3
Structural similarity within and among languages
Theoretical Computer Science - Algebraic methods in language processing
LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
A Characterization of Minimalist Languages
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Regular Tree Languages Without Unary Symbols are Star-Free
FCT '93 Proceedings of the 9th International Symposium on Fundamentals of Computation Theory
Parsing with Probabilistic Strictly Locally Testable Tree Languages
IEEE Transactions on Pattern Analysis and Machine Intelligence
Static analysis of xml transformation and schema languages
Static analysis of xml transformation and schema languages
Regular tree languages definable in FO and in FOmod
ACM Transactions on Computational Logic (TOCL)
Top-down recognizers for MCFGs and MGs
CMCL '11 Proceedings of the 2nd Workshop on Cognitive Modeling and Computational Linguistics
Closure properties of minimalist derivation tree languages
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Minimalist tree languages are closed under intersection with recognizable tree languages
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
| Hi-index | 0.00 |
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.