Weighted finite automata over strong bimonoids

: We investigate weighted finite automata over strings and strong bimonoids. Such algebraic structures satisfy the same laws as semirings except that no distributivity laws need to hold. We define two different behaviors and prove precise characterizations for them if the underlying strong bimonoid satisfies local finiteness conditions. Moreover, we show that in this case the given weighted automata can be determinized.

• Type: Journal
• Year: 2010
• Where: ISCI
• Authors: Manfred Droste, Torsten Stüber, Heiko Vogler
• Keywords: ISCI 2010, Strong Bimonoid, Strong Bimonoid Satisfies, Such Algebraic Structures