A Note on the Complexity of the Recognition Problem for the Minimalist Grammars with Unbounded Scrambling and Barriers. - Alexander Perekrestenko (Proces. del Leng. Natural, 2007)

Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard. - Alexander Perekrestenko (LATA, 2008)

Networks of Evolutionary Processors as Natural Parsers. - Gemma Bel Enguix; María Dolores Jiménez-López; Robert Mercas; Alexander Perekrestenko (ICAART, 2009)

PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing. - Alfonso Ortega 002; Emilio del Rosal García; Diana Pérez 001; Robert Mercas; Alexander Perekrestenko; Manuel Alfonseca 001 (IWANN (1), 2009)