On The Computational Complexity of Marcus Contextual Languages

We investigate the computational complexity of the basic type of contextual languages, that is, the ones introduced by Marcus and called subsequently external contextual languages. We prove that the family of languages generated by external contextual grammars with context-free selection contains only polynomial time parsable languages.