Abstract
In this paper, we consider the problem of finding iteration theorems for various subfamilies of deterministic languages. Because deterministic languages are constrained in their generation, it is not possible to merely “pump substrings” as in the general context free case. We lay out, in detail, a collection of techniques for proving theorems of this type for deterministic context free languages.
Get full access to this article
View all access options for this article.