On the Regular Emptiness Problem of Subzero Automata

Henryk Michalewski, Matteo Mio, Mikołaj Bojańczyk
2016 Electronic Proceedings in Theoretical Computer Science  
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.
doi:10.4204/eptcs.223.1 fatcat:wecnbpznjrdm7c2lj4tiqi5tpe