Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
395551 | Information Sciences | 2010 | 11 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Manfred Droste, Torsten Stüber, Heiko Vogler,