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

Authors

108

  1. SA
    Sheila A. Greibach

    University of California, Los Angeles, United States

    4 publications · 499 citations

    4

    h-index

  2. JE
    Joost Engelfriet

    Leiden University, Netherlands

    3 publications · 99 citations

    3

    h-index

  3. CD
    Chris Dyer

    Carnegie Mellon University, United States

    3 publications · 1.1K citations

    3

    h-index

  4. SL
    Salvatore La Torre

    University of Salerno, Italy

    2 publications · 156 citations

    2

    h-index

  5. MA
    Michael A. Harrison

    University of California, Berkeley, United States

    2 publications · 366 citations

    2

    h-index

1–5 of 108

Venues

  1. Journal of Computer and System Sciences

    7 publications · 272 citations

    7

    h-index

  2. Information and Control

    5 publications · 291 citations

    5

    h-index

  3. Journal of the ACM

    JACM · 5 publications · 555 citations

    5

    h-index

  4. Information and Computation

    2 publications · 66 citations

    2

    h-index

  5. Pacific Asia Conference on Language, Information, and Computation

    Conference · 2 publications · 164 citations

    2

    h-index

1–5