The boundedness and zero isolation problems for weighted automata over nonnegative rationals
We consider linear cost-register automata (equivalent to weighted automata) over the
semiring of nonnegative rationals, which generalise probabilistic automata. The two …
semiring of nonnegative rationals, which generalise probabilistic automata. The two …
Universality and Forall-Exactness of Cost Register Automata with Few Registers
L Daviaud, A Ryzhikov - 48th International Symposium on …, 2023 - drops.dagstuhl.de
The universality problem asks whether a given finite state automaton accepts all the input
words. For quantitative models of automata, where input words are mapped to real values …
words. For quantitative models of automata, where input words are mapped to real values …