Abstract
The semirings admitting maximal factorizations of any finite dimension are called MF-semirings. We first show that a commutative semiring K is an MF-semiring if and only if K admits a maximal factorization of dimension n ≥ 2, and if and only if K is a multiplicatively cancellative semiring satisfying the g.c.d. condition. And then, by using above result, we prove that a weighted finite automaton [Formula: see text] over a commutative idempotent MF-semiring has a determination if [Formula: see text] has the victory property and twins property. Also, some special cases are considered.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
