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.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32477 |
| Date | 13 December 2018 |
| Creators | Droste, Manfred, Stüber, Torsten, Vogler, Heiko |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:article, info:eu-repo/semantics/article, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 0020-0255 |
Page generated in 0.002 seconds