joint work with Damian Niwiński and Michał Skrzypczak

We consider the problem of computing the measure of a regular language of infinite trees with respect to so called coin-flipping measure. While the problem is unsolved in general, some progress
has been made. In this talk I will show that we can compute the measure of language specified by a first order formula using child relations and the letter predicates, discuss the limitations of the algorithm, and compare it to previously known results.