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
8 citations
20 Jun 2017
TL;DR: It is proved that non-emptiness of timed register pushdown automata is decidable in doubly exponential time, which is a very expressive class of automata, whose transitions may involve state and top-of-stack clocks with unbounded differences.
Abstract: We prove that non-emptiness of timed register pushdown automata is decidable in doubly exponential time. This is a very expressive class of automata, whose transitions may involve state and top-of-stack clocks with unbounded differences. It strictly subsumes pushdown timed automata of Bouajjani et al., dense-timed pushdown automata of Abdulla et al., and orbit-finite timed register pushdown automata of Clemente and Lasota. Along the way, we prove two further decidability results of independent interest: for non-emptiness of least solutions to systems of equations over sets of integers with addition, union and intersections with N and -N, and for reachability in one-dimensional branching vector addition systems with states and subtraction, both in exponential time.
8 citations
13 Sep 2009
TL;DR: Results show that grid-like schemes, in contrast to chain- and tree-like ones, yield extremely precise approximations for rather coarse abstractions.
Abstract: This paper studies quantitative model checking of infinite tree-like (continuous-time) Markov chains. These tree-structured quasi-birth death processes are equivalent to probabilistic pushdown automata and recursive Markov chains and are widely used in the field of performance evaluation. We determine time-bounded reachability probabilities in these processes ---which with direct methods, i.e., uniformization, results in an exponential blow-up--- by applying abstraction. We contrast abstraction based on Markov decision processes (MDPs) and interval-based abstraction; study various schemes to partition the state space, and empirically show their influence on the accuracy of the obtained reachability probabilities. Results show that grid-like schemes, in contrast to chain- and tree-like ones, yield extremely precise approximations for rather coarse abstractions.
8 citations
TL;DR: A general framework for deriving tabular algorithms for a very large class of stack-based computations, not only in context-free parsing but in logic programming as well and more generally for all kinds of “information” domains.
8 citations
07 Feb 2009
TL;DR: This paper uses the learning capability of finite automata to develop an authorship identification system using writing samples of an author to build a stochastic finite automaton that can be used to test whether an anonymous writing piece belongs to this author.
Abstract: This paper uses the learning capability of finite automata to develop an authorship identification system. Based on ALERGIA algorithm, we use writing samples of an author to build a stochastic finite automaton. This automaton represents the writing characteristics of the author. This automaton, then, can be used to test whether an anonymous writing piece belongs to this author. Initial tests are quite successful.
8 citations