Power of Randomization in Automata on Infinite Strings

DOI10.1007/978-3-642-04081-8_16zbMath1254.68131arXiv1109.2536OpenAlexW2107081125MaRDI 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (9)

The Effect of Tossing Coins in Omega-Automata ⋮ Randomization in Automata on Infinite Trees ⋮ Recurrence and transience for finite probabilistic tables ⋮ Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata ⋮ A survey of partial-observation stochastic parity games ⋮ Partial-Observation Stochastic Games ⋮ Unnamed Item ⋮ Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds ⋮ Deciding Maxmin Reachability in Half-Blind Stochastic Games

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

This page was built for publication: Power of Randomization in Automata on Infinite Strings