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

Alexander Perekrestenko

Browse the full LATA paper archive.