On the problem of computing the probability of regular sets of trees

DOI10.4230/LIPICS.FSTTCS.2015.489MaRDI QIDQ5275391zbMATH OpenFDO

Authors Henryk Michalewski, Matteo Mio

Publication date 13 July 2017

Full work available at URL https://arxiv.org/abs/1510.01640

zbMATH Keywords

meta-parity gamesprobabilityregular languages of trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of game theory (91A80)

Recommendations

• The uniform measure of simple regular sets of infinite trees
• Measure properties of regular sets of trees
• Measure Properties of Game Tree Languages
• Irregular behaviours for probabilistic automata
• Randomization in automata on infinite trees

Cited in

(12)

• Rational probability measures
• The uniform measure of simple regular sets of infinite trees
• Measure properties of regular sets of trees
• scientific article; zbMATH DE number 3885337 (Why is no real title available?)
• On computing the measures of first-order definable sets of trees
• Probability of first return on Cayley trees
• Monadic Second Order Logic with Measure and Category Quantifiers
• Separable GPL: decidable model checking with more non-determinism
• scientific article; zbMATH DE number 7561608 (Why is no real title available?)
• An upper bound for the critical probability on the Cartesian product graph of a regular tree and a line
• Probabilistic regular expressions and MSO logic on finite trees
• Computing measures of weak-mso definable sets of trees

This page was built for publication: On the problem of computing the probability of regular sets of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5275391)