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
••
14 Oct 1974
TL;DR: This work considers some of the important unsolved problems in the theory of computation concerning the relationship between deterministic and nondeterministic computations, and between tape and time bounded computations and finds an equivalent problem concerning two way deterministic pushdown automaton languages.
Abstract: We consider some of the important unsolved problems in the theory of computation concerning the relationship between deterministic and nondeterministic computations, and between tape and time bounded computations. For each such problem we find an equivalent problem concerning two way deterministic pushdown automaton languages. This is the first time many of the open problems have been reduced to questions about one class of automata.
19 citations
••
TL;DR: The computational complexity of the problems of equivalence and regularity on real-time one-counter automata is studied and PSPACE -completeness of the problem if a given one- counter automaton is bisimulation equivalent to a finite system is proved.
19 citations
••
31 Aug 2010TL;DR: It is proved that whenever player □ has a winning strategy, then she also has a strategy that can be specified by a timed automaton, and an exponential-time algorithm is given which computes a winning timing automaton strategy if it exists.
Abstract: We consider two-player stochastic games over real-time probabilistic processes where the winning objective is specified by a timed automaton. The goal of player □ is to play in such a way that the play (a timed word) is accepted by the timed automaton with probability one. Player ⋄ aims at the opposite. We prove that whenever player □ has a winning strategy, then she also has a strategy that can be specified by a timed automaton. The strategy automaton reads the history of a play, and the decisions taken by the strategy depend only on the region of the resulting configuration. We also give an exponential-time algorithm which computes a winning timed automaton strategy if it exists.
19 citations
••
TL;DR: An infinite hierarchy of language families is established that coincides with the hierarchy resulting from the n-limited state grammars, so the deep pushdown automata actually represent the automaton counterpart to these Grammars.
Abstract: This paper introduces and discusses deep pushdown automata as a generalization of the classical pushdown automata. This generalization consists in allowing them to make expansions deeper in the pushdown. Based on the expansion depth, the present paper establishes an infinite hierarchy of language families that coincides with the hierarchy resulting from the n-limited state grammars, so the deep pushdown automata actually represent the automaton counterpart to these grammars. In its conclusion, this paper suggests some open problem areas.
19 citations
01 Jan 2002
TL;DR: It is proved undecidability of the problem whether a given pair of pushdown processes is weakly bisimilar and this result extends to a subclass of push down processes satisfying the normedness condition.
Abstract: We prove undecidability of the problem whether a given pair of pushdown processes is weakly bisimilar. We also show that this unde- cidability result extends to a subclass of pushdown processes satisfying the normedness condition.
19 citations