3 citations · 9 across the 10 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2024★ 2 cited
Computing measures of weak-MSO definable sets of trees
Damian Niwiński, Marcin Przybyłko, Michał Skrzypczak
This work addresses the problem of computing measures of recognisable sets of infinite trees. An algorithm is provided to compute the probability measure of a tree language recogni…
cs.FL2020
The Uniform Measure of Simple Regular Sets of Infinite Trees
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…