3 citations · 9 across the 10 of their papers we have counts for
1 paper · 1 filter
Marcin Przybyłko
We consider the problem of computing the measure of a regular language of infinite binary trees. While the general case remains unsolved, we show that the measure of a language def…