Computer Science: Iteration Theorems for Families of Strict Deterministic Languages

K.N. King

EECS Department, University of California, Berkeley

Technical Report No. UCB/ERL M78/15

1978

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/1978/Archive/ERL-m-78-15.pdf

BibTeX citation:

@techreport{King:M78/15,
    Author= {King, K.N.},
    Title= {Computer Science: Iteration Theorems for Families of Strict Deterministic Languages},
    Year= {1978},
    Month= {Apr},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1978/28921.html},
    Number= {UCB/ERL M78/15},
}

EndNote citation:

%0 Report
%A King, K.N. 
%T Computer Science: Iteration Theorems for Families of Strict Deterministic Languages
%I EECS Department, University of California, Berkeley
%D 1978
%@ UCB/ERL M78/15
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1978/28921.html
%F King:M78/15