Automata, Probability, and Recursion

DOI10.1007/978-3-540-70844-5_3MaRDI QIDQ3602797zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(10)

• Analysis of probabilistic processes and automata theory
• Model checking of recursive probabilistic systems
• Runtime analysis of probabilistic programs with unbounded recursion
• Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
• Analysis of Recursive Probabilistic Models
• On the termination problem for probabilistic higher-order recursive programs
• Tools and Algorithms for the Construction and Analysis of Systems
• STACS 2005
• Probabilism versus Alternation for Automata
• On the termination problem for probabilistic higher-order recursive programs

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)