On the Regular Emptiness Problem of Subzero Automata
Formal Languages and Automata Theory
2016-08-12 v1 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.1608.03319,
title = {On the Regular Emptiness Problem of Subzero Automata},
author = {Henryk Michalewski and Matteo Mio and Mikołaj Bojańczyk},
journal= {arXiv preprint arXiv:1608.03319},
year = {2016}
}
Comments
In Proceedings ICE 2016, arXiv:1608.03131