Photo from archive.org
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. Click to show full 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.
Keywords:
automata output;
finite automata;
weighted finite
Journal Title: Soft Computing
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Soft Computing
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!