On the Regular Emptiness Problem of Subzero Automata

TL;DR

This paper proves that it is decidable whether a subzero automaton accepts some regular tree, advancing understanding of automata with probabilistic acceptance conditions.

Contribution

It establishes the decidability of the regular emptiness problem for subzero automata, a class with probabilistic constraints.

Findings

Decidability of the regular emptiness problem for subzero automata

Introduction of techniques for analyzing probabilistic tree automata

Foundation for further research on automata with probabilistic acceptance

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.