Weighted finite automata with output
Jelena Ignjatovi\'c, Miroslav \'Ciri\'c, Zorana Jan\v{c}i\'c
TL;DR
This paper establishes the equivalence of different types of weighted finite automata with output, under various semantics, providing a unified understanding of their computational behavior.
Contribution
It proves the equivalence of sequential, Mealy-type, and Moore-type weighted automata with output, clarifying their relationships under multiple semantics.
Findings
Proved equivalence of automata types under various semantics
Unified understanding of weighted automata with output
Clarified relationships among automata models
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic · Logic, programming, and type systems