Polynomial automata: Zeroness and applications
LICS, pp. 1-12, 2017.
We introduce a generalisation of weighted automata over a field, called polynomial automata, and we analyse the complexity of the Zeroness Problem in this model, that is, whether a given automaton outputs zero on all words. While this problem is non-primitive recursive in general, we highlight a subclass of polynomial automata for which t...More
Full Text (Upload PDF)
PPT (Upload PPT)