On the Regular Emptiness Problem of Subzero Automata
arXiv:1608.03319 · doi:10.4204/EPTCS.223.1
Abstract
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.
In Proceedings ICE 2016, arXiv:1608.03131