TWO THEOREMS ABOUT GALIUKSCHOV SEMICONTEXTUAL LANGUAGES
Gheorghe Pǎun · Czech digital mathematics library · 1985
We solve an open problem formulated in [1] (there are semicontextual grammars of degree two which generate non-context-free languages) and we extend a result in [1], concerning the closure properties of semicontextual languages families (all of them are anti-AFVs).