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
03 Mar 2006
TL;DR: A hands-on approach to problem solving in the formal languages and automata theory course, and a new feature in JFLAP, Turing machine building blocks, where one can now build complex Turing machines by using other Turing machines as components or building blocks.
Abstract: We present a hands-on approach to problem solving in the formal languages and automata theory course. Using the tool JFLAP, students can solve a wide range of problems that are tedious to solve using pencil and paper. In combination with the more traditional theory problems, students study a wider-range of problems on a topic. Thus, students explore the formal languages and automata concepts computationally and visually with JFLAP, and theoretically without JFLAP. In addition, we present a new feature in JFLAP, Turing machine building blocks. One can now build complex Turing machines by using other Turing machines as components or building blocks.
33 citations
04 Apr 2005
TL;DR: It is shown that for each (IA$^{*}_{3}$)-term one can construct a pushdown automaton recognizing a representation of the strategy induced by the term, which gives an Exptime decision procedure for contextual equivalence and approximation for β-normal terms.
Abstract: The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA$^*_{3}$). They are approached via a combination of game semantics and language theory. It is shown that for each (IA$^{*}_{3}$)-term one can construct a pushdown automaton recognizing a representation of the strategy induced by the term. The automata have some additional properties ensuring that the associated equivalence and inclusion problems are solvable in Ptime. This gives an Exptime decision procedure for contextual equivalence and approximation for β-normal terms. Exptime-hardness is also shown in this case, even in the absence of iteration.
33 citations
03 Sep 2007
TL;DR: A new class of alternating automata called alternating jump automata (AJA), which extend classical alternating finite-state automata over infinite words by also allowing non-local moves and shows that one- way AJA and two-way AJA have the same expressiveness and capture exactly the class of VPL.
Abstract: We investigate various classes of alternating automata for visibly pushdown languages (VPL) over infinite words. First, we show that alternating visibly pushdown automata (AVPA) are exactly as expressive as their nondeterministic counterpart (NVPA) but basic decision problems for AVPA are 2EXPTIMEcomplete. Due to this high complexity, we introduce a new class of alternating automata called alternating jump automata (AJA). AJA extend classical alternating finite-state automata over infinite words by also allowing non-local moves. A non-local forward move leads a copy of the automaton from a call input position to the matching-return position. We also allow local and non-local backward moves. We show that one-way AJA and two-way AJA have the same expressiveness and capture exactly the class of VPL. Moreover, boolean operations for AJA are easy and basic decision problems such as emptiness, universality, and pushdown model-checking for parity two-way AJA are EXPTIME-complete. Finally, we consider a linear-time fixpoint calculus which subsumes the full linear-time µ-calculus (with both forward and backward modalities) and the logic CARET and captures exactly the class of VPL. We show that formulas of this logic can be linearly translated into parity two-way AJA, and vice versa. As a consequence satisfiability and pushdown model checking for this logic are EXPTIME-complete.
33 citations
TL;DR: This work considers analog recurrent neural networks as language recognizers over the Cantor space, and proves that the classes of w-languages recognized by deterministic and non-deterministic analog networks correspond precisely to the respective classes of @P"2^0-sets and @S"1^1-sets of the Cantorspace.
33 citations
TL;DR: It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata, where the pushdown behaves like a counter.
Abstract: It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata, where the pushdown behaves like a counter. Also finiteness up to bisimilarity is shown to be decidable for the mentioned processes.
33 citations