Automata, Probability, and Recursion

DOI10.1007/978-3-540-70844-5_3zbMATH Open1172.68533OpenAlexW1560643563MaRDI QIDQ3602797FDOQ3602797

Authors: Mihalis Yannakakis 

Publication date: 12 February 2009

Published in: Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_3

Recommendations

• STACS 2005
• Automata, Languages and Programming
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Model checking of recursive probabilistic systems
• Tools and Algorithms for the Construction and Analysis of Systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stochastic games, stochastic differential games (91A15)

Cited In (9)

• 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
• STACS 2005
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Analysis of Recursive Probabilistic Models
• Runtime analysis of probabilistic programs with unbounded recursion

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)