Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,894,108 papers from all fields of science
Search
Sign In
Create Free Account
Deterministic pushdown automaton
Known as:
NDPDA
, DPA
, DPDA
Expand
In automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the pushdown automaton. The class of deterministic pushdown…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Automata theory
Context-free grammar
Context-free language
Deterministic context-free grammar
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A comment on "Automata theory based on complete residuated lattice-valued logic: Pushdown automata"
Xiuhong Guo
Fuzzy Sets Syst.
2012
Corpus ID: 43721872
2012
2012
Decidability of DPDA Language Equivalence via First-Order Grammars
P. Jančar
27th Annual IEEE Symposium on Logic in Computer…
2012
Corpus ID: 1467306
Decidability of language equivalence of deterministic pushdown automata (DPDA) was established by G. Senizergues (1997), who thus…
Expand
2009
2009
Subtree matching by deterministic pushdown automata
T. Flouri
,
B. Melichar
,
Jan Janousek
International Multiconference on Computer Science…
2009
Corpus ID: 6378636
Subtree matching is an important problem in Computer Science on which a number of tasks, such as mechanical theorem proving, term…
Expand
2004
2004
Improving FSM evolution with progressive fitness functions
Jason W. Horihan
,
Yung-Hsiang Lu
ACM Great Lakes Symposium on VLSI
2004
Corpus ID: 374229
This paper presents a method to reduce the total number of generations needed to evolve a nite state machine using genetic…
Expand
1997
1997
Tally Languages Accepted by Monte Carlo Pushdown Automata
J. Kaņeps
,
D. Geidmanis
,
R. Freivalds
International Workshop Randomization and…
1997
Corpus ID: 15194403
Rather often difficult (and sometimes even undecidable) problems become easily decidable for tally languages, i.e. for languages…
Expand
1992
1992
NPDA: A Tool for Visualizing and Simulating Nondeterministic Pushdown Automata
Dan Caugherty
,
S. Rodger
Computational Support for Discrete Mathematics
1992
Corpus ID: 30619360
1980
1980
Equivalence problem for real-time strict deterministic pushdown automata
V. Y. Romanovskii
CYBERNETICS
1980
Corpus ID: 116544065
1980
1980
A Simplicity Test for Deterministic Pushdown Automata
M. Oyamaguchi
,
Y. Inagaki
,
N. Honda
Information and Control
1980
Corpus ID: 2523712
1976
1976
A Note on the Succinctness of Descriptions of Deterministic Languages
L. Valiant
Information and Control
1976
Corpus ID: 11951808
1974
1974
Recursive Schemes, Algebraic Trees and Deterministic Languages
B. Courcelle
Scandinavian Workshop on Algorithm Theory
1974
Corpus ID: 10336917
The equivalence problems for uninterpreted recursive program schemes and deterministic pushdown automata are reducible to each…
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