Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard

Authors:
Alexander Perekrestenko
Affiliations:
Research Group on Mathematical Linguistics International PhD School in Formal Languages and Applications, Rovira i Virgili University, Tarragona, Spain 43005
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 4
Cited 0

Derivational Minimalism

LACL '96 Selected papers from the First International Conference on Logical Aspects of Computational Linguistics
Derivational Minimalism Is Mildly Context-Sensitive

LACL '98 Selected papers from the Third 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Minimalist Grammars were proposed in [15] as a formalization of the basic structure-building component of the Minimalism Program, a syntactic framework introduced in [2] and [3]. In the present paper we investigate the effects of extending this formalism with an unrestricted scrambling operator together with nondiscriminating barriers. We show that the recognition problem for the resulting formalism NP-hard. The result presented here is a generalization of the result shown by the author in [14] for Minimalist Grammars with unrestricted scrambling and category-sensitive barriers.