28 citations · 43 across the 11 of their papers we have counts for
1 paper · 1 filter
Mikolaj Bojańczyk, Hugo Gimbert, Edon Kelmendi
Zero automata are a probabilistic extension of parity automata on infinite trees. The satisfiability of a certain probabilistic variant of mso, called tmso + zero, reduces to the e…