Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,757 papers from all fields of science
Search
Sign In
Create Free Account
Pushdown automaton
Known as:
Push-Down Automaton
, Nondeterministic pushdown automaton
, Pushdown autonoma
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
35 relations
Ambiguous grammar
Automata theory
Backtracking
Chomsky hierarchy
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Fibonacci words, hyperbolic tilings and grossone
M. Margenstern
Communications in nonlinear science & numerical…
2015
Corpus ID: 1553746
2011
2011
First-Order Model Checking on Generalisations of Pushdown Graphs
Alexander Kartzow
arXiv.org
2011
Corpus ID: 19615184
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested…
Expand
2010
2010
Linear Orders in the Pushdown Hierarchy
Laurent Braud
,
Arnaud Carayol
International Colloquium on Automata, Languages…
2010
Corpus ID: 17617368
We investigate the linear orders belonging to the pushdown hierarchy. Our results are based on the characterization of the…
Expand
2009
2009
Games on Multi-stack Pushdown Systems
Anil Seth
Symposium on Logical Foundations of Computer…
2009
Corpus ID: 45242132
Bounded phase multi-stack pushdown automata have been studied recently. In this paper we show that parity games over bounded…
Expand
2006
2006
A Table-Driven Streaming XML Parsing Methodology for High-Performance Web Services
Wei Zhang
,
Robert A. van Engelen
IEEE International Conference on Web Services…
2006
Corpus ID: 8990047
This paper presents a table-driven streaming XML parsing methodology, called TDX. TDX expedites XML parsing by pre-recording the…
Expand
1997
1997
Querying String Databases with Modal Logic
Matti Nykanen
1997
Corpus ID: 58977502
New application areas for databases demand the possibility of managing not only the traditional atomic but also structured data…
Expand
Review
1993
Review
1993
Logic and Algebra of Specification
Wilfried Brauer
,
H. Schwichtenberg
NATO ASI Series
1993
Corpus ID: 6165297
Distributed Action Systems.- Lectures on: Classical Proofs as Programs.- Linear Logic: A Survey.- Some Proof-Theoretic Aspects of…
Expand
1991
1991
Quantifier Hierarchies over Word Relations
Sebastian Seibert
Annual Conference for Computer Science Logic
1991
Corpus ID: 34196355
We consider analogues of the arithmetical hierarchy over word relations, obtained by replacing the class of recursive relations…
Expand
1988
1988
Using Prolog to present abstract machines
D. Crookes
SGCS
1988
Corpus ID: 14791373
Introductory courses in Theory of Computation usually include a study of abstract machines such as finite state machines and…
Expand
1970
1970
R70-21 Time and Tape Complexity of Pushdown Automaton Languages
T. F. Arnold
IEEE transactions on computers
1970
Corpus ID: 26533922
This paper is concerned with the recognition of words which are contained in languages defined by pushdown store machines. Such…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE