On the Regular Emptiness Problem of Subzero Automata

11 Aug 2016 · Michalewski Henryk University of Warsaw, Poland, Mio Matteo CNRS and ENS-Lyon, France, Bojańczyk Mikołaj University of Warsaw, Poland ·

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 automaton accepts some regular tree is decidable.