Abstract
In this paper we shall prove that is is undecidable whether the intersection of two k-limited 0L languages is empty, finite, regular, context-free or a k-limited language, whether the language generated by a context-free grammar is a k-limited 0L language or whether a klT0L language can be generated by a context-free grammar. Furthermore, it is undecidable whether the union of two k-limited 0L languages is such a language again.
Get full access to this article
View all access options for this article.