On the Regular Emptiness Problem of Subzero Automata

2016/08/11 by Henryk Michalewski, Matteo Mio, Mikołaj Bojańczyk
Computer Science · #cs.FL #cs.LO

paper · pdf · doi:10.4204/eptcs.223.1

published as EPTCS 223, 2016, pp. 1-23 · In Proceedings ICE 2016, arXiv:1608.03131

arxiv created 2016/08/11 · arxiv updated 2016/08/12

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.

Citations

• Proceedings 9th Interaction and Concurrency Experience