Pushdown Automata Complexity

Pushdown Automata Complexity is a theoretical framework in computational complexity theory that characterizes the resource-based classification of formal languages according to the computational power and operational constraints inherent to pushdown automata.

57

Publications

2.2K

Citations

89

Authors

60

Institutions

Publications per year

2017–2026

3

Authors

89

  1. BP
    Beatrice Palano

    University of Milan, Italy

    4 publications · 73 citations

    4

    h-index

  2. ÓH
    Óscar H. Ibarra

    University of California, Santa Barbara, United States

    4 publications · 202 citations

    4

    h-index

  3. CM
    Carlo Mereghetti

    University of Milan, Italy

    4 publications · 73 citations

    4

    h-index

  4. KS
    Kai Salomaa

    Queen's University, Canada

    3 publications · 89 citations

    3

    h-index

  5. ZB
    Zuzana Bednárová

    University of Milan, Italy

    3 publications · 52 citations

    3

    h-index

1–5 of 89

Venues

  1. Theoretical Computer Science

    8 publications · 240 citations

    8

    h-index

  2. Information and Control

    7 publications · 505 citations

    7

    h-index

  3. Journal of Computer and System Sciences

    6 publications · 173 citations

    6

    h-index

  4. SIAM Journal on Computing

    4 publications · 187 citations

    4

    h-index

  5. International Journal of Foundations of Computer Science

    IJFCS · 3 publications · 56 citations

    3

    h-index

1–5