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
Parents
18
Model checking probabilistic pushdown automata
Javier Esparza, Antonı́n Kučera, Richard Mayr · 2004 · 124 citations · Full text
Cynthia Dwork, Larry Stockmeyer · Journal of the ACM · 1992 · 91 citations · Full text
Reasoning about Recursive Probabilistic Programs
Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen et al. · 2016 · 86 citations
Relating probabilistic grammars and automata
Steven Abney, David McAllester, Fernando Pereira · 1999 · 82 citations · Full text
1–5 of 18
26
6
h-index
4
h-index
4
h-index
3
h-index
3
h-index
1–5 of 26
17
University of Stuttgart
Stuttgart, Germany
5 h-index
8 publications
482 citations

Masaryk University
Brno, Czechia
4 h-index
5 publications
342 citations
Columbia University
New York, United States
3 h-index
3 publications
83 citations

University of Edinburgh
Edinburgh, United Kingdom
3 h-index
6 publications
166 citations
RWTH Aachen University
Aachen, Germany
2 h-index
8 publications
392 citations
University of Oxford
Oxford, United Kingdom
2 h-index
4 publications
78 citations

University of Freiburg
Freiburg im Breisgau, Germany
2 h-index
2 publications
184 citations
North Carolina State University
Raleigh, United States
2 h-index
2 publications
100 citations
1–8 of 17
2 publications · 29 citations
2
h-index
JACM · 2 publications · 101 citations
2
h-index
1 publications · 45 citations
1
h-index
1 publications · 38 citations
1
h-index
Repository · 1 publications · 22 citations
1
h-index
1–5