Stack Automata
Stack Automata is a computational model that extends finite automata with a stack memory structure, enabling context-sensitive language recognition through controlled access to stack contents during transitions.
61
Publications
3.5K
Citations
108
Authors
61
Institutions
Publications per year
2017–2026
7
Parents
61
Transition-Based Dependency Parsing with Stack Long Short-Term Memory
Chris Dyer, Miguel Ballesteros, Austin Matthews et al. · 2015 · 560 citations · Full text
Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison · Journal of the ACM · 1967 · 225 citations · Full text
On context-free languages and push-down automata
M. P. Schützenberger · Information and Control · 1963 · 182 citations
Seymour Ginsburg, Sheila A. Greibach, Michael A. Harrison · Journal of the ACM · 1967 · 141 citations · Full text
1–5 of 61
108
University of California, Los Angeles, United States
4 publications · 499 citations
4
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 108
61

Harvard University Press
Cambridge, United States
5 h-index
5 publications
512 citations
University of Oxford
Oxford, United Kingdom
3 h-index
7 publications
230 citations

Justus-Liebig-Universität Gießen
Giessen, Germany
2 h-index
4 publications
60 citations

University of Salerno
Fisciano, Italy
2 h-index
3 publications
178 citations
Université Paris Cité
Paris, France
2 h-index
4 publications
55 citations

University of Twente
Enschede, The Netherlands
2 h-index
3 publications
55 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
8 publications
4.3K citations

Universitat Pompeu Fabra
Barcelona, Spain
2 h-index
5 publications
2.8K citations
1–8 of 61
7 publications · 272 citations
7
h-index
5 publications · 291 citations
5
h-index
JACM · 5 publications · 555 citations
5
h-index
2 publications · 66 citations
2
h-index
Conference · 2 publications · 164 citations
2
h-index
1–5