Topic
Pushdown automaton
About: Pushdown automaton is a research topic. Over the lifetime, 1868 publications have been published within this topic receiving 35399 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: A new type of automation, called a two-way pushdown automaton is defined and studied which includes relationships with other families, closure and nonclosure results, and decidability properties.
Abstract: In this paper, a new type of automation, called a two-way pushdown automaton is defined and studied. The model is a generalization of a pushdown automaton in that two-way motion is allowed on the input tape which is assumed to have endmarkers. The model is investigated in both the nondeterministic and deterministic cases. A number of basic results are obtained which include relationships with other families, closure and nonclosure results, and decidability properties. Certain special cases are studied such as the cases when the input alphabet has one letter and the device has no endmarkers.
61 citations
61 citations
TL;DR: Several facts about multihead pushdown automata are obtained, indicating that the study of alternating multihead finite automata may lead to useful results about nonalternating automata.
60 citations
TL;DR: Since a timed automaton can be treated as a PTA without the pushdown stack, it can be shown that the binary reachability of a timedAutomaton is definable in the additive theory of reals and integers.
59 citations
28 Jun 2003
TL;DR: It is shown that a tree language recognizing by a deterministic parity automaton is either hard for the co-Buchi level and therefore cannot be recognized by a weak alternating automaton, or is on a very low level in the hierarchy ofWeak alternating automata.
Abstract: We show that a tree language recognized by a deterministic parity automaton is either hard for the co-Buchi level and therefore cannot be recognized by a weak alternating automaton, or is on a very low level in the hierarchy of weak alternating automata. A topological counterpart of this property is that a deterministic tree language is either Π11 complete (and hence nonBorel), or it is on the level Π30 of the Borel hierarchy. We also give a new simple proof of the strictness of the hierarchy of weak alternating automata.
59 citations