Pushdown Automata Complexity
Pushdown Automata Complexity is a theoretical framework in computational complexity theory that characterizes the resource-based classification of formal languages according to the computational power and operational constraints inherent to pushdown automata.
57
Publications
2.2K
Citations
89
Authors
60
Institutions
Publications per year
2017–2026
3
Parents
57
On context-free languages and push-down automata
M. P. Schützenberger · Information and Control · 1963 · 182 citations
Gary L. Peterson, John H. Reif · 1979 · 157 citations
A regularity test for pushdown machines
Richard E. Stearns · Information and Control · 1967 · 111 citations
1–5 of 57
89
4
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 89
60

University of Milan
Milan, Italy
6 h-index
10 publications
210 citations

University of Turku
Turku, Finland
4 h-index
4 publications
114 citations

University of Warsaw
Warsaw, Poland
3 h-index
4 publications
142 citations
Queen's University
Kingston, Canada
3 h-index
3 publications
89 citations
University of Washington
Seattle, United States
2 h-index
4 publications
338 citations

Sun Yat-sen University
Guangzhou, China
2 h-index
4 publications
171 citations

University of Waterloo
Waterloo, Canada
2 h-index
3 publications
125 citations

University of Rochester
Rochester, United States
2 h-index
3 publications
342 citations
1–8 of 60
8 publications · 240 citations
8
h-index
7 publications · 505 citations
7
h-index
6 publications · 173 citations
6
h-index
4 publications · 187 citations
4
h-index
IJFCS · 3 publications · 56 citations
3
h-index
1–5