Henryk Michalewski (University of Warsaw, Poland) |
Matteo Mio (CNRS and ENS-Lyon, France) |
Mikołaj Bojańczyk (University of Warsaw, Poland) |
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. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.223.1 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |