Abstract
It is shown that a) there is an equal matrix language which cannot be written as a finite intersection of context-free languages and b) any finite intersection of context-free languages can be generated by a regular conditional grammar with context-free control languages.
Get full access to this article
View all access options for this article.