6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965) (1965)

Ann Arbor, MI

Oct. 6, 1965 to Oct. 8, 1965

pp: 203-220

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.1965.7

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.

INDEX TERMS

CITATION

S. Greibach and S. Ginsburg, "Deterministic context free languages,"

*6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)(FOCS)*, Ann Arbor, MI, 1965, pp. 203-220.

doi:10.1109/FOCS.1965.7

CITATIONS