Nondeterministic Pushdown Automata

A Nondeterministic Pushdown Automaton is a computational model that extends a finite automaton with a stack-based memory, allowing multiple possible transitions from a given state for the same input and stack symbol, thereby enabling nondeterministic behavior in recognizing context-free languages.

44

Publications

2.1K

Citations

68

Authors

48

Institutions

Publications per year

2017–2026

1

Variants

Npdas

Authors

68

  1. SC
    Stephen Cook

    University of Toronto, Canada

    3 publications · 520 citations

    3

    h-index

  2. BP
    Beatrice Palano

    University of Milan, Italy

    2 publications · 32 citations

    2

    h-index

  3. KS
    Kai Salomaa

    Queen's University, Canada

    2 publications · 83 citations

    2

    h-index

  4. PD
    Patrick Dymond

    York University, Canada

    2 publications · 158 citations

    2

    h-index

  5. SH
    Susan H. Rodger

    Duke University, United States

    2 publications · 88 citations

    2

    h-index

1–5 of 68

Venues

  1. Journal of Computer and System Sciences

    7 publications · 306 citations

    7

    h-index

  2. Theoretical Computer Science

    6 publications · 150 citations

    6

    h-index

  3. Information and Control

    5 publications · 473 citations

    5

    h-index

  4. SIAM Journal on Computing

    3 publications · 160 citations

    3

    h-index

  5. Journal of the ACM

    JACM · 3 publications · 392 citations

    3

    h-index

1–5