Iteration Theorems for Deterministic Families of Languages

Article type: Research Article

Authors: Harrison, Michael A.^{; *}

Affiliations: Computer Science Division, University of California, Berkeley, California 947201, U.S.A.

Note: [*] Sponsored by the National Science Foundation under Grant MCS-8311781 and by the Defense Advanced Research Projects Agency (DoD), Arpa Order No. 4871, monitored by Naval Electronics Systems Command, under Contract No. N00039-84-C-0089.

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.

DOI: 10.3233/FI-1986-9406

Journal: Fundamenta Informaticae, vol. 9, no. 4, pp. 481-508, 1986