Weighted finite automata with output
arXiv:1410.2415
Abstract
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.
Preprint submitted to Soft Computing