Weighted finite automata over strong bimonoids

  • Authors:
  • Manfred Droste;Torsten Stüber;Heiko Vogler

  • Affiliations:
  • Institut für Informatik, Universität Leipzig, D-04009 Leipzig, Germany;Faculty of Computer Science, Technische Universität Dresden, D-01062 Dresden, Germany;Faculty of Computer Science, Technische Universität Dresden, D-01062 Dresden, Germany

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2010

Quantified Score

Hi-index 0.07

Visualization

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.