论文信息 - Deterministic Context Free Languages

Deterministic Context Free Languages

A number of results about deterministic languages (languages accepted by pushdown automata with no choice of moves) are established. In particular, o (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.

Seymour Ginsburg | Sheila A. Greibach

[1] Seymour Ginsburg,et al. Quotients of Context-Free Languages , 1963, JACM.

[2] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[3] S. Ginsburg,et al. Sequences in context free languages , 1965 .

[4] Leonard Harold Haines. Generation and recognition of formal languages , 1965 .

[5] S. Ginsburg,et al. BOUNDED ALGOL-LIKE LANGUAGES^) , 1964 .

[6] Dana S. Scott,et al. Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[7] Donald E. Knuth,et al. On the Translation of Languages from Left to Right , 1965, Inf. Control..

[8] Patrick C. Fischer. On computability by certain classes of restricted Turing machines , 1963, SWCT.

[9] Noam Chomsky,et al. The Algebraic Theory of Context-Free Languages* , 1963 .

[10] Seymour Ginsburg,et al. Operations Which Preserve Definability in Languages , 1963, JACM.

[11] S. Ginsburg,et al. Bounded -like languages , 1964 .

[12] Marcel Paul Schützenberger,et al. On Context-Free Languages and Push-Down Automata , 1963, Inf. Control..

[13] Sheila A. Greibach,et al. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.