Pushdown Automata

Pushdown Automaton is a computational model that extends a finite automaton with a stack-based memory, enabling it to recognize context-free languages by using push and pop operations on the stack during state transitions.

287

Publications

13.4K

Citations

417

Authors

207

Institutions

Publications per year

2017–2026

20

Authors

417

  1. JE
    Javier Esparza

    Technical University of Munich, Germany

    10 publications · 711 citations

    10

    h-index

  2. MH
    Matthew Hague

    University of Oxford, United Kingdom

    7 publications · 264 citations

    7

    h-index

  3. ÓH
    Óscar H. Ibarra

    University of California, Santa Barbara, United States

    7 publications · 244 citations

    7

    h-index

  4. OS
    Olivier Serre

    Université Paris Cité, France

    6 publications · 259 citations

    6

    h-index

  5. TT
    Tayssir Touili

    Université Paris Cité, France

    6 publications · 268 citations

    6

    h-index

1–5 of 417

Venues

  1. Theoretical Computer Science

    24 publications · 924 citations

    17

    h-index

  2. Journal of the ACM

    JACM · 14 publications · 2.7K citations

    13

    h-index

  3. Journal of Computer and System Sciences

    12 publications · 315 citations

    11

    h-index

  4. Information and Control

    11 publications · 704 citations

    11

    h-index

  5. SIAM Journal on Computing

    9 publications · 339 citations

    9

    h-index

1–5