Nested Stack Automata
Nested Stack Automata is a computational model that extends the classical pushdown automaton by allowing the stack itself to contain nested substacks, thereby enabling the representation and manipulation of hierarchical data structures through recursive stack operations.
8
Publications
271
Citations
13
Authors
10
Institutions
Publications per year
2017–2026
0
Parents
8
Alfred V. Aho · Journal of the ACM · 1969 · 137 citations · Full text
Computing, Computer Systems, Building Information Modeling +6
Indexed grammars -- An extension of context free grammars
Alfred V. Aho · 1967 · 36 citations
Winning Regions of Higher-Order Pushdown Games
Arnaud Carayol, Matthew Hague, Antoine Meyer et al. · Proceedings - Symposium on Logic in Computer Science · 2008 · 25 citations
1–5 of 8
13
2
h-index
Centre National de la Recherche Scientifique, France
1 publications · 10 citations
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 13
10

Sorbonne Université
Paris, France
2 h-index
3 publications
60 citations
Université Paris Cité
Paris, France
1 h-index
1 publications
25 citations

University of Warwick
Coventry, United Kingdom
1 h-index
1 publications
21 citations

Tata Institute of Fundamental Research
Mumbai, India
1 h-index
1 publications
13 citations

Ollscoil na Gaillimhe – University of Galway
Galway, Ireland
1 h-index
1 publications
21 citations

Johns Hopkins University
Baltimore, United States
1 h-index
1 publications
15 citations
Yale University
New Haven, United States
1 h-index
1 publications
15 citations

Centre National de la Recherche Scientifique
Paris, France
1 h-index
1 publications
25 citations
1–8 of 10
LICS · 1 publications · 25 citations
1
h-index
Repository · 1 publications · 10 citations
1
h-index
PRE · 1 publications · 13 citations
1
h-index
Repository · 1 publications · 14 citations
1
h-index
JACM · 1 publications · 137 citations
1
h-index
1–5