Weighted finite automata with output

In this paper we prove the equivalence of sequential, Mealy-type and Moore-type weighted finite automata with output, with respect to various semantics which are defined here.Comment: Preprint submitted to Soft Computin