Sign Up to like & get
recommendations!
0
Published in 2018 at "Soft Computing"
DOI: 10.1007/s00500-017-2493-y
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.
read more here.
Keywords:
automata output;
finite automata;
weighted finite;