31 citations · 69 across the 15 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2016★ 2 cited
On the Regular Emptiness Problem of Subzero Automata
Henryk Michalewski, Matteo Mio, Mikołaj Bojańczyk
Subzero automata is a class of tree automata whose acceptance condition can express probabilistic constraints. Our main result is that the problem of determining if a subzero autom…
cs.FL2015★ 2 cited
On the Problem of Computing the Probability of Regular Sets of Trees
Henryk Michalewski, Matteo Mio
We consider the problem of computing the probability of regular languages of infinite trees with respect to the natural coin-flipping measure. We propose an algorithm which compute…