Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Dense-timed pushdown automata with a timed stack were introduced by Abdulla et al. in LICS 2012 to model the behavior of real… 
2011
2011
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested… 
2010
2010
We investigate the linear orders belonging to the pushdown hierarchy. Our results are based on the characterization of the… 
2009
2009
Bounded phase multi-stack pushdown automata have been studied recently. In this paper we show that parity games over bounded… 
2006
2006
This paper presents a table-driven streaming XML parsing methodology, called TDX. TDX expedites XML parsing by pre-recording the… 
1997
1997
New application areas for databases demand the possibility of managing not only the traditional atomic but also structured data… 
1983
1983
We define topdown pushdown tree automata (PDTA's) which extend the usual string pushdown automata by allowing trees instead of… 
1970
1970
This paper is concerned with the recognition of words which are contained in languages defined by pushdown store machines. Such…