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: In this article, the complexity of equivalence and minimisation for automata with transition weights in the field Q of rational numbers was studied and algorithms for deciding equivalence by reduction to equivalence of Q-weighted automata were given.
Abstract: This paper is concerned with the computational complexity of equivalence and minimisation for automata with transition weights in the field Q of rational numbers. We use polynomial identity testing and the Isolation Lemma to obtain complexity bounds, focussing on the class NC of problems within P solvable in polylogarithmic parallel time. For finite Q-weighted automata, we give a randomised NC procedure that either outputs that two automata are equivalent or returns a word on which they differ. We also give an NC procedure for deciding whether a given automaton is minimal, as well as a randomised NC procedure that minimises an automaton. We consider probabilistic automata with rewards, similar to Markov Decision Processes. For these automata we consider two notions of equivalence: expectation equivalence and distribution equivalence. The former requires that two automata have the same expected reward on each input word, while the latter requires that each input word induce the same distribution on rewards in each automaton. For both notions we give algorithms for deciding equivalence by reduction to equivalence of Q-weighted automata. Finally we show that the equivalence problem for Q-weighted visibly pushdown automata is logspace equivalent to the polynomial identity testing problem.
29 citations
•
TL;DR: An n-EXPTIME lower bound is proved for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n, which matches the known upper bound for parity games on HPDA.
Abstract: We prove an n-EXPTIME lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n This bound matches the known upper bound for parity games on HPDA As a consequence the mu-calculus model checking over graphs given by n-HPDA is n-EXPTIME complete
29 citations
••
14 Jun 1988TL;DR: An errorless probabilistic algorithm is given for the undirected graph s-t connectivity problem that runs in O(log n) space and polynomial expected time, and it is shown that the class LOGCFL is closed under complementation.
Abstract: A recent proof that nondeterministic space-bounded complexity classes are closed under complementation is used to develop two further applications of the inductive counting technique. An errorless probabilistic algorithm is given for the undirected graph s-t connectivity problem that runs in O(log n) space and polynomial expected time, and it is shown that the class LOGCFL is closed under complementation. The latter is a special case of a general result that shows closure under complementation of classes defined by semiunbounded fan-in circuits (or, equivalently, nondeterministic auxiliary pushdown automata or tree-sized bounded alternating Turing machines). As one consequence, small numbers of role switches in two-person pebbling can be eliminated. >
29 citations
••
TL;DR: A theorem answering the question "how many states does a minimal deterministic finite automaton recognizing the set of base-b numbers divisible by k have?" is presented and proved.
29 citations
••
26 Jun 2006TL;DR: The synchronization of a pushdown automaton by a sequential transducer associating an integer to each input word is introduced and languages which form an effective boolean algebra containing the regular languages are included in the deterministic real-time context-free languages.
Abstract: We introduce the synchronization of a pushdown automaton by a sequential transducer associating an integer to each input word. The visibly pushdown automata are the automata synchronized by an one state transducer whose output labels are –1,0,1. For each transducer, we can decide whether a pushdown automaton is synchronized. The pushdown automata synchronized by a given transducer accept languages which form an effective boolean algebra containing the regular languages and included in the deterministic real-time context-free languages.
29 citations