Pushdown Automata Decision Problems

Pushdown Automata Decision Problems is a theoretical computer science construct that refers to a class of formal decision problems concerning the determination of properties—such as emptiness, finiteness, equivalence, or inclusion—associated with pushdown automata and the context-free languages they recognize.

8

Publications

364

Citations

18

Authors

11

Institutions

Publications per year

2017–2026

0

Authors

18

  1. ÓH
    Óscar H. Ibarra

    University of California, Santa Barbara, United States

    1 publications · 54 citations

    1

    h-index

  2. KČ
    Karel Čulík

    University of Waterloo, Canada

    1 publications · 26 citations

    1

    h-index

  3. JB
    J.A. Bergstra

    University of Amsterdam, Netherlands

    1 publications · 24 citations

    1

    h-index

  4. PG
    Pierre Ganty

    IMDEA Software Institute, Spain

    1 publications · 22 citations

    1

    h-index

  5. IB
    I. Bethke

    University of Amsterdam, Netherlands

    1 publications · 24 citations

    1

    h-index

1–5 of 18

Venues

  1. SIAM Journal on Computing

    2 publications · 80 citations

    2

    h-index

  2. SIAM Journal on Control

    1 publications · 175 citations

    1

    h-index

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

    Repository · 1 publications · 13 citations

    1

    h-index

  4. Acta Informatica

    1 publications · 24 citations

    1

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 26 citations

    1

    h-index

1–5