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: It is proved that there is an algorithm for deciding whether two deterministic stateless pushdown automata are equivalent and it is shown that equivalence can be tested in double-exponential time.
Abstract: It is proved that there is an algorithm for deciding whether two deterministic stateless pushdown automata are equivalent. It is shown that equivalence can be tested in double-exponential time.
28 citations
20 Aug 2001
TL;DR: A general reduction from labelled transition systems to unlabelled ones is suggested, preserving bisimilarity and satisfiability of µ-calculus formulas.
Abstract: In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled transition systems to unlabelled ones, preserving bisimilarity and satisfiability of μ-calculus formulas. We apply the reduction to the class of transition systems generated by Petri nets and pushdown automata, and obtain several decidability/complexity corollaries for unlabelled systems. Probably the most interesting result is undecidability of strong bisimilarity for unlabelled Petri nets.
27 citations
TL;DR: The motion of these particles is characterized, and it is shown that it falls into several regimes, ranging from simple deterministic motion, to generalized random walks, to complex motion emulating Turing machines or pushdown automata.
27 citations
Journal Article•
TL;DR: In this article, the complexity of comparing pushdown automata and context-free processes to finite-state systems was studied, and it was shown that strong and weak simulation preorder (and hence simulation equivalence) is EXPTIME-complete.
Abstract: We study the complexity of comparing pushdown automata (PDA) and context-free processes (BPA) to finite-state systems, w.r.t. strong and weak simulation preorder/equivalence and strong and weak bisimulation equivalence. We present a complete picture of the complexity of all these problems. In particular, we show that strong and weak simulation preorder (and hence simulation equivalence) is EXPTIME-complete between PDA/BPA and finite-state systems in both directions. For PDA the lower bound even holds if the finite-state system is fixed, while simulation-checking between BPA and any fixed finite-state system is already polynomial. Furthermore, we show that weak (and strong) bisimilarity between PDA and finite-state systems is PSPA CE-complete, while strong (and weak) bisimilarity between two PDAs is EXPTIME-hard.
27 citations
TL;DR: This paper allows obstacles moving in discrete steps and verify that the finite automaton with just five printing symbols can escape or find the exit and shows results shown for static obstacles distributed over integer grid.
Abstract: A variety of interesting problems arise in the study of finite automata that move about in a two dimensional space. The model proposed by Muller [4] is used here to construct new automaton which can explore any labyrinth and escape through the moving or dynamic obstacles inside over the grid. The earlier results were shown for static obstacles distributed over integer grid and the automaton in this case was constructed to interact on the rectangular grid location endowed with four neighborhood directional states. In this paper we allow obstacles moving in discrete steps and verify that the finite automaton with just five printing symbols can escape or find the exit.
27 citations