scispace - formally typeset
Search or ask a question
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
More filters
Journal ArticleDOI
01 Jan 2018
TL;DR: The results marry game semantics with automata-theoretic techniques developed to handle infinite alphabets and show decidability of the emptiness problem for register pushdown automata extended with fresh-symbol generation.
Abstract: We present a full classification of decidable and undecidable cases for contextual equivalence in a finitary ML-like language equipped with full ground storage (both integers and reference names can be stored). The simplest undecidable type is $$\mathsf {unit}\rightarrow \mathsf {unit}\rightarrow \mathsf {unit}$$ . At the technical level, our results marry game semantics with automata-theoretic techniques developed to handle infinite alphabets. On the automata-theoretic front, we show decidability of the emptiness problem for register pushdown automata extended with fresh-symbol generation.

6 citations

Journal Article
TL;DR: This work gives a constructive way to remove the "-transitions on the linear-shaped parts of a WFA and an optimal bound of the number of new transitions produced.
Abstract: Weighted Finite Automata (WFA) over (max; +)-semirings are used for pattern matching in genomic databanks with substitution costs. They can be eeciently parsed using reconngurable hardware like FPGAs (Field Programmable Gate Arrays) implementing the linear encoding scheme. In biological applications, one wants to double every regular transition with an \"-transition to modelize deletions. Critical paths in the F-PGA prevent chains of \"-transitions from being arbitrarily large, so the \"-transitions must be removed. Generic \"-transitions-removal algorithms produce too many new transitions. We propose an analysis of the \"-transitions-removal under a condition of path-equivalence. In particular, we give a constructive way to remove the \"-transitions on the linear-shaped parts of a WFA and an optimal bound of the number of new transitions produced.

5 citations

Journal ArticleDOI
TL;DR: It is proved that any basic parallel process is rooted branching bisimulation equivalent to a regular process communicating with a bag (also called a parallel pushdown automaton) and therefore the bag can regard the bag as the prototypicalbasic parallel process.

5 citations

Book ChapterDOI
16 Jul 2003
TL;DR: The notion of a well-formed bag automaton, which is used to model the inherent problems associated with the retrieval of biomolecules from solution, is defined.
Abstract: In this paper, we define the notion of a well-formed bag automaton, which is used to model the inherent problems associated with the retrieval of biomolecules from solution.We will consider the computational power and other properties of non-deterministic and deterministic, well-formed bag automata.

5 citations

Book ChapterDOI
05 Mar 2012
TL;DR: Improved work is improved by introducing optimized on-the-fly algorithms to test universality and inclusion problems of visibly pushdown automata to show that the proposed method outperforms the standard one by several orders of magnitude.
Abstract: In this paper we improve our previous work by introducing optimized on-the-fly algorithms to test universality and inclusion problems of visibly pushdown automata. We implement the proposed algorithms in a prototype tool. We conduct experiments on randomly generated VPA. The experimental results show that the proposed method outperforms the standard one by several orders of magnitude.

5 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
87% related
Finite-state machine
15.1K papers, 292.9K citations
86% related
Model checking
16.9K papers, 451.6K citations
84% related
Concurrency
13K papers, 347.1K citations
84% related
String (computer science)
19.4K papers, 333.2K citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202314
202234
202129
202052
201947
201834