Weighted finite automata with output
classification
💻 cs.FL
keywords
automatafiniteoutputweighteddefinedequivalenceheremealy-type
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.