Linearity is Polynomially Decidable for Realtime Pushdown Store Automatia

If M is a realtime deterministic pushdown store acceptor, the language L ( M ) accepted by M by final state and empty store is linear context-free if and only if a certain grammar obtained from M is linear context-free. Hence, it is polynomially decidable for realtime deterministic pushdown store automata M whether L(M) is linear context-free. If M is a realtime deterministic pushdown store acceptor and L ( M ) is linear context-free, we can construct a realtime single turn deterministic pushdown store automaton {if27-1} with {if27-2}. Hence “ L ( M ) = L ” is decidable for M a realtime deterministic pushdown store acceptor and L the language accepted by final state by a single turn deterministic pushdown store acceptor.

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

[2]  Emily P. Friedman.  A Note on Non-Singular Deterministic Pushdown Automata , 1978, Theor. Comput. Sci..

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

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

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

[6]  Sheila A. Greibach,et al.  Superdeterministic PDAs , 1980, J. ACM.

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

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

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

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

[11]  Catriel Beeri.  An Improvement on Valiant's Decision Procedure for Equivalence of Deterministic Finite Turn Pushdown Machines , 1976, Theor. Comput. Sci..

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

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

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

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

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

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

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

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

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

[21]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..