Probabilistic Pushdown Automata

Probabilistic Pushdown Automata is a probabilistic extension of nondeterministic pushdown automata in which transitions are governed by probability distributions over input symbols, stack operations, and state changes, thereby modeling stochastic context-free language generation and recognition.

18

Publications

821

Citations

26

Authors

17

Institutions

Publications per year

2017–2026

0

Authors

26

  1. JE
    Javier Esparza

    Technical University of Munich, Germany

    6 publications · 365 citations

    6

    h-index

  2. AK
    Antonı́n Kučera

    Masaryk University, Czechia

    4 publications · 297 citations

    4

    h-index

  3. SK
    Stefan Kiefer

    University of Oxford, United Kingdom

    4 publications · 124 citations

    4

    h-index

  4. RM
    Richard Mayr

    University of Edinburgh, United Kingdom

    3 publications · 252 citations

    3

    h-index

  5. KE
    Kousha Etessami

    University of Edinburgh, United Kingdom

    3 publications · 83 citations

    3

    h-index

1–5 of 26

Venues

  1. Information and Computation

    2 publications · 29 citations

    2

    h-index

  2. Journal of the ACM

    JACM · 2 publications · 101 citations

    2

    h-index

  3. Formal Methods in System Design

    1 publications · 45 citations

    1

    h-index

  4. Performance Evaluation

    1 publications · 38 citations

    1

    h-index

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

    Repository · 1 publications · 22 citations

    1

    h-index

1–5