a more abstract characterisation in the setting of semirings. Formally, a domain semiring is a semiring S extended by a domain operation d : S → S which, for all x, y ∈ S, sati...
Abstract: We define rationally additive semirings that are a generalization of ()complete and (-)continuous semirings. We prove that every rationally additive semiring is an iterat...
For several semirings S, two weighted finite automata with multiplicities in S are equivalent if and only if they can be connected by a chain of simulations. Such a semiring S is c...