6 citations · 7 across the 3 of their papers we have counts for
1 paper · 2 filters
Marcin Przybyłko, Michał Skrzypczak
We consider the problem of computing the measure of a regular set of infinite binary trees. While the general case remains unsolved, we show that the measure of a language can be c…