On Equivalence and Subclass Containment Problems for Deterministic Context-Free Languages

[1]  Leslie G. Valiant,et al.  Deterministic One-Counter Automata , 1975, J. Comput. Syst. Sci..

[2]  Richard Edwin Stearns,et al.  A Regularity Test for Pushdown Machines , 1967, Inf. Control..

[3]  Robert McNaughton,et al.  Parenthesis Grammars , 1967, JACM.

[4]  S. Ginsburg,et al.  Finite-Turn Pushdown Automata , 1966 .

[5]  Emily P. Friedman,et al.  Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes , 1977, J. Comput. Syst. Sci..

[6]  Sheila A. Greibach,et al.  An Infinite Hierarchy of Context-Free Languages , 1969, JACM.

[7]  Leslie G. Valiant,et al.  Decision procedures for families of deterministic pushdown automata , 1973 .

[8]  Arnold L. Rosenberg,et al.  Real-Time Definable Languages , 1967, JACM.

[9]  John E. Hopcroft,et al.  Simple Deterministic Languages , 1966, SWAT.

[10]  Leslie G. Valiant,et al.  Regularity and Related Problems for Deterministic Pushdown Automata , 1975, JACM.

[11]  Matthew M. Geller,et al.  On LR(k) Grammars and Languages , 1977, Theor. Comput. Sci..

[12]  Seymour Ginsburg,et al.  Deterministic Context Free Languages , 1966, Inf. Control..

[13]  Daniel J. Rosenkrantz,et al.  Properties of Deterministic Top-Down Grammars , 1970, Inf. Control..

[14]  Tadao Kasami,et al.  A Result on the Equivalence Problem for Deterministic Pushdown Automata , 1976, J. Comput. Syst. Sci..

[15]  Leslie G. Valiant.  The Equivalence Problem for Deterministic Finite-Turn Pushdown Automata , 1974, Inf. Control..

[16]  Sheila A. Greibach,et al.  Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia , 1979, Inf. Control..