Iteration Theorems for Deterministic Families of Languages

Michael A. Harrison

EECS Department, University of California, Berkeley

Technical Report No. UCB/CSD-86-271

1986

This publication is archived. It is kept only for reference purposes, so it is no longer being updated and may not meet accessibility standards. If you need this content in a different format, please email webteam@eecs.berkeley.edu.

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1986/Archive/CSD-86-271.pdf

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.

BibTeX citation:

@techreport{Harrison:CSD-86-271,
    Author= {Harrison, Michael A.},
    Title= {Iteration Theorems for Deterministic Families of Languages},
    Year= {1986},
    Month= {Dec},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1986/6085.html},
    Number= {UCB/CSD-86-271},
    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.},
}

EndNote citation:

%0 Report
%A Harrison, Michael A. 
%T Iteration Theorems for Deterministic Families of Languages
%I EECS Department, University of California, Berkeley
%D 1986
%@ UCB/CSD-86-271
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1986/6085.html
%F Harrison:CSD-86-271