A Deterministic Pushdown Automaton is a pushdown automaton in which, for any given state, input symbol, and top stack symbol, there is at most one permissible transition, ensuring unambiguous, deterministic computation during syntax analysis.
57
Publications
2.4K
Citations
78
Authors
51
Institutions
Publications per year
2017–2026
4
Publications
57
Adding nesting structure to words
Rajeev Alur, P. Madhusudan · Journal of the ACM · 2009 · 329 citations
Stream processing of XPath queries with predicates
Ashish Gupta, Dan Suciu · 2003 · 282 citations
Simple deterministic languages
A. J. Korenjak, John E. Hopcroft · Annual Symposium on Switching & Automata Theory · 1966 · 225 citations
Properties that characterize LOGCFL
H. Venkateswaran · Journal of Computer and System Sciences · 1991 · 120 citations
1–5 of 57
Authors
78
- ET
4
h-index
- ZB
2
h-index
- CB
2
h-index
- VG
2
h-index
- BP
2
h-index
1–5 of 78
Institutions
51
University of Milan
Milan, Italy
3 h-index
5 publications
90 citations
University of Washington
Seattle, United States
3 h-index
5 publications
606 citations
University of Electro-Communications
Tokyo, Japan
3 h-index
4 publications
47 citations
University of Oxford
Oxford, United Kingdom
2 h-index
4 publications
143 citations
Cornell University
Ithaca, United States
2 h-index
2 publications
52 citations
Justus-Liebig-Universität Gießen
Giessen, Germany
2 h-index
4 publications
60 citations
University of Warsaw
Warsaw, Poland
2 h-index
2 publications
48 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
2 publications
65 citations
1–8 of 51
Venues
- Journal of the ACM
JACM · 7 publications · 517 citations
7
h-index
- Journal of Computer and System Sciences
5 publications · 280 citations
5
h-index
- SIAM Journal on Computing
4 publications · 139 citations
4
h-index
- Theoretical Computer Science
4 publications · 84 citations
4
h-index
- Information Processing Letters
3 publications · 48 citations
3
h-index
1–5