Power of Randomization in Automata on Infinite Strings

DOI10.2168/LMCS-7(3:22)2011zbMath1237.68111MaRDI QIDQ5895526

Rohit Chadha, Mahesh Viswanathan, A. Sistla Prasad

Publication date: 2 April 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

zbMATH Keywords

randomizationdecidabilityexpressivenessomega-regular languagesautomata on infinite stringsprobabilistic monitors

Mathematics Subject Classification ID

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

Related Items (3)

Ambiguity, weakness, and regularity in probabilistic Büchi automata ⋮ Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata ⋮ Decidable and expressive classes of probabilistic automata

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