Power of Randomization in Automata on Infinite Strings
From MaRDI portal
Publication:5895118
DOI10.1007/978-3-642-04081-8_16zbMath1254.68131arXiv1109.2536MaRDI QIDQ5895118
No author found.
Publication date: 22 October 2009
Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.2536
68Q45: Formal languages and automata
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
Recurrence and transience for finite probabilistic tables, Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds, The Effect of Tossing Coins in Omega-Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Defining liveness
- Automata-theoretic techniques for modal logics of programs
- On the expressiveness and complexity of randomization in finite state monitors
- On Decision Problems for Probabilistic Büchi Automata
- Probabilistic automata
- Potentials for denumerable Markov chains