DocumentCode
3263795
Title
Deterministic context free languages
Author
Ginsburg, Seymour ; Greibach, Sheila
fYear
1965
fDate
6-8 Oct. 1965
Firstpage
203
Lastpage
220
Abstract
A number of results about deterministic languages (languages accepted by pushdown automata with no choice of moves) are established. In particular, (1) each deterministic language is unambiguous. (2) the complement of each deterministic language is a deterministic language. (3) numerous operations which preserve deterministic languages (for example, intersection with a regular set) are obtained. (4) several problems are shown to be recursively unsolvable.
Keywords
Automata;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching Circuit Theory and Logical Design, 1965. SWCT 1965. Sixth Annual Symposium on
Conference_Location
Ann Arbor, MI, USA
Type
conf
DOI
10.1109/FOCS.1965.7
Filename
5397242
Link To Document