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

Authors

13

  1. AV
    Alfred V. Aho

    Princeton University, United States

    2 publications · 173 citations

    2

    h-index

  2. CH
    Christopher H. Broadbent

    Centre National de la Recherche Scientifique, France

    1 publications · 10 citations

    1

    h-index

  3. AC
    Arnaud Carayol

    Laboratoire d'Informatique Gaspard-Monge, France

    1 publications · 25 citations

    1

    h-index

  4. PL
    Porus Lakdawala

    Tata Institute of Fundamental Research, India

    1 publications · 13 citations

    1

    h-index

  5. OS
    Olivier Serre

    Université Paris Cité, France

    1 publications · 25 citations

    1

    h-index

1–5 of 13

Venues

  1. Proceedings - Symposium on Logic in Computer Science

    LICS · 1 publications · 25 citations

    1

    h-index

  2. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 1 publications · 10 citations

    1

    h-index

  3. 1

    h-index

  4. ArXiv.org

    Repository · 1 publications · 14 citations

    1

    h-index

  5. Journal of the ACM

    JACM · 1 publications · 137 citations

    1

    h-index

1–5