Randomization in Automata on Infinite Trees

DOI10.1145/2629336zbMath1354.68150OpenAlexW1966886635MaRDI QIDQ2946733

Arnaud Carayol, Olivier Serre, Axel Haddad

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01260669/file/CHS13_ACM_ToCL.pdf

zbMATH Keywords

measure theoryprobabilistic automatafinite automata on infinite trees(partial observation) Markov decision processes

Mathematics Subject Classification ID

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

Related Items (6)

Erratum for “Randomization in Automata on Infinite Trees” ⋮ Measure Quantifier in Monadic Second Order Logic ⋮ Baire Category Quantifier in Monadic Second Order Logic ⋮ Unnamed Item ⋮ Counting branches in trees using games ⋮ Monadic Second Order Logic with Measure and Category Quantifiers

Cites Work

• Mathematical metaphysics of randomness
• Probability theory. Translated from the German by Robert B. Burckel
• Automata on infinite trees with counting constraints
• On equivalence of infinite product measures
• Probabilistic Weighted Automata
• Probabilistic ω-automata
• On Decision Problems for Probabilistic Büchi Automata
• Probabilistic automata
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Power of Randomization in Automata on Infinite Strings
• Measure and integration theory. Transl. from the German by Robert B. Burckel
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Randomization in Automata on Infinite Trees