Nondeterministic Pushdown Automata
A Nondeterministic Pushdown Automaton is a computational model that extends a finite automaton with a stack-based memory, allowing multiple possible transitions from a given state for the same input and stack symbol, thereby enabling nondeterministic behavior in recognizing context-free languages.
44
Publications
2.1K
Citations
68
Authors
48
Institutions
Publications per year
2017–2026
1
Variants
Npdas
Parents
44
On context-free languages and push-down automata
M. P. Schützenberger · Information and Control · 1963 · 182 citations
Two Applications of Inductive Counting for Complementation Problems
Allan Borodin, Stephen Cook, Patrick Dymond et al. · SIAM Journal on Computing · 1989 · 135 citations
Properties that characterize LOGCFL
H. Venkateswaran · Journal of Computer and System Sciences · 1991 · 120 citations
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits
Vishwa Vinay · 2002 · 113 citations
1–5 of 44
68
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 68
48

University of Milan
Milan, Italy
4 h-index
6 publications
128 citations

University of Toronto
Toronto, Canada
3 h-index
5 publications
678 citations
Goethe University Frankfurt
Frankfurt am Main, Germany
3 h-index
3 publications
63 citations
IBM (United States)
Armonk, United States
3 h-index
3 publications
340 citations
University of Pavol Jozef Šafárik
Košice, Slovakia
2 h-index
4 publications
64 citations
Duke University
Durham, United States
2 h-index
4 publications
176 citations
Columbia University
New York, United States
2 h-index
2 publications
57 citations
Georgia Institute of Technology
Atlanta, United States
2 h-index
2 publications
150 citations
1–8 of 48
7 publications · 306 citations
7
h-index
6 publications · 150 citations
6
h-index
5 publications · 473 citations
5
h-index
3 publications · 160 citations
3
h-index
JACM · 3 publications · 392 citations
3
h-index
1–5