Automata, Probability, and Recursion
From MaRDI portal
Publication:3602797
Recommendations
Cited in
(9)- Runtime analysis of probabilistic programs with unbounded recursion
- Probabilism versus Alternation for Automata
- On the termination problem for probabilistic higher-order recursive programs
- Model checking of recursive probabilistic systems
- Tools and Algorithms for the Construction and Analysis of Systems
- On the termination problem for probabilistic higher-order recursive programs
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- STACS 2005
- Analysis of Recursive Probabilistic Models
This page was built for publication: Automata, Probability, and Recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602797)