Equivalence problem for real-time strict deterministic pushdown automata

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

[2]  Ivan M. Havel,et al.  Strict Deterministic Grammars , 1973, J. Comput. Syst. Sci..

[3]  Ivan M. Havel,et al.  Real-Time Strict Deterministic Languages , 1972, SIAM J. Comput..

[4]  A. Anisimov.  Subclasses of deterministic context-free languages , 1973 .

[5]  Matti Linna.  Two Decidability Results for Deterministic Pushdown Automata , 1977, MFCS.

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

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

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

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

[10]  Michio Oyamaguchi,et al.  The Equivalence Problem for Real-Time Strict Deterministic Languages , 1980, Inf. Control..

[11]  Sheila A. Greibach,et al.  Superdeterministic DPDAS: The Method for Accepting Does Affect Decision Problems , 1979, J. Comput. Syst. Sci..

[12]  Michio Oyamaguchi,et al.  The Decidability of Equivalence for Determistic Stateless Pushdown Automata , 1978, Inf. Control..

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

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

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

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

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

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