2 citations · 3 across the 2 of their papers we have counts for
2 papers
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…
math.LO2009★ 1 cited
On the Borel Inseparability of Game Tree Languages
Szczepan Hummel, Henryk Michalewski, Damian Niwinski
The game tree languages can be viewed as an automata-theoretic counterpart of parity games on graphs. They witness the strictness of the index hierarchy of alternating tree automat…