Preview

Description

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.

Details

Files

Actions

Statistics

from
to
Export
Download Full History