Showing papers on "Deterministic pushdown automaton published in 1980"
TL;DR: The equivalence problem is decidable for deterministic real-time pushdown store automata accepting by empty stack for two deterministic pushdown stores automata, one of which is real- time accepting byempty stack.
Abstract: The equivalence problem is decidable for deterministic real-time pushdown store automata accepting by empty stack. Further, the equivalence problem is decidable for two deterministic pushdown store automata, one of which is real-time accepting by empty stack.
57 citations
TL;DR: This paper proves that there exists an effective procedure for deciding whether the language accepted by a deterministic pushdown automaton (dpda) is real-time strict.
Abstract: A context-free language is said to be real-time strict if it is accepted by a real-time deterministic pushdown automaton with empty stack acceptance. This paper proves that there exists an effective procedure for deciding whether the language accepted by a deterministic pushdown automaton (dpda) is real-time strict. The result implies the following: For any subclass ℰ of real-time dpda's with empty stack acceptance, the problem for deciding whether a dpda is equivalent to some machine in ℰ reduces to that for deciding whether a real-time dpda with empty stack acceptance is equivalent to some machine in ℰ.
6 citations
28 Apr 1980
TL;DR: The main result of the paper is that the generalized procedure yields an equivalence test for proper dpda's, at least one of which is also a finite-turn machine.
Abstract: A generalization of the alternate stacking procedure of Valiant for deciding the equivalence of some deterministic pushdown automata (dpda) is introduced. To analyze the power of the generalized procedure we define a subclass of dpda's, called the proper dpda's. This class properly contains the non-singular dpda's and the real time strict dpda's, and the corresponding class of languages properly contains the real time strict deterministic languages. The equivalence problem for proper automata is reducible to the problem of deciding whether or not an automaton is proper. The main result of the paper is that the generalized procedure yields an equivalence test for proper dpda's, at least one of which is also a finite-turn machine.
4 citations
TL;DR: It is proved that it is decidable whether a deterministic pushdown automaton (dpda) accepts a simple language and that the language accepted by M is simple if and only if M satisfies the two conditions.
Abstract: A context-free language is said to be simple if it is accepted by a single-state deterministic pushdown automaton with empty stack acceptance. This paper proves that it is decidable whether a deterministic pushdown automaton (dpda) accepts a simple language. For this purpose, we prove that it is decidable whether a real-time dpda with empty stack acceptance accepts a simple language. To prove this, we present two conditions called nonsingularity and separability conditions and show that for a real-time dpda M with empty stack acceptance, (i) the language accepted by M is simple if and only if M satisfies the two conditions, and (ii) it is decidable whether M satisfies the two conditions.
3 citations
01 Jan 1980
2 citations
TL;DR: Large scores in the number of e-moves a DPDA can make without entering a loop or decreasing its stack below the original stack height are investigated and are the upper bound for one-state DPDA’s.