Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Pushdown automaton

Known as: Push-Down Automaton, Nondeterministic pushdown automaton, Pushdown autonoma 
In computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack. Pushdown automata are used in theories about what can be… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
In an input-driven pushdown automaton (IDPDA), the current input symbol determines whether the automaton performs a push… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We propose the class of visibly pushdown languages as embeddings of context-free languages that is rich enough to model program… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2003
Highly Cited
2003
One of the central axioms of extreme programming is the disciplined use of regression testing during stepwise software… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We show that the monadic second-order theory of an infinite tree recognized by a higher-order pushdown automaton of any level is… Expand
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This chapter is devoted to context-free languages. Context-free languages and grammars were designed initially to formalize… Expand
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly… Expand
  • figure 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Abstract This paper gives a simple and direct algorithm for computing the always regular set of reachable states of a pushdown… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Games given by transition graphs of pushdown processes are considered. It is shown that if there is a winning strategy in such a… Expand
  • figure 1
Is this relevant?
1993
1993
In order for neural networks to learn complex languages or grammars, they must have sufficient computational power or resources… Expand
Is this relevant?
1989
1989
In 1985, Goldwasser, Micali and Racko formulated interactive proof systems as a tool for developing cryptographic protocols… Expand
Is this relevant?