Iteration Theorems for Deterministic Families of Languages
Michael A. Harrison
EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-86-271
1985
http://www.eecs.berkeley.edu/Pubs/TechRpts/1986/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},
Institution = {EECS Department, University of California, Berkeley},
Year = {1985},
Month = {Dec},
URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1985/6085.html},
Number = {UCB/CSD-86-271}
}
EndNote citation:
%0 Report %A Harrison, Michael A. %T Iteration Theorems for Deterministic Families of Languages %I EECS Department, University of California, Berkeley %D 1985 %@ UCB/CSD-86-271 %U http://www.eecs.berkeley.edu/Pubs/TechRpts/1985/6085.html %F Harrison:CSD-86-271