Determinization of weighted finite automata over strong bimonoids

@article{Ciric2010DeterminizationOW,
  title={Determinization of weighted finite automata over strong bimonoids},
  author={Miroslav Ciric and Manfred Droste and Jelena Ignjatovic and Heiko Vogler},
  journal={Inf. Sci.},
  year={2010},
  volume={180},
  pages={3497-3520}
}
We consider weighted finite automata over strong bimonoids, where these weight structures can be considered as semirings which might lack distributivity. Then, in general, the well-known run semantics, initial algebra semantics, and transition semantics of an automaton are different. We prove an algebraic characterization for the initial algebra semantics in terms of stable finitely generated submonoids. Moreover, for a given weighted finite automaton we construct the Nerode automaton and… CONTINUE READING
BETA

Similar Papers

Citations

Publications citing this paper.
SHOWING 1-10 OF 23 CITATIONS

DIFFERENT MODELS OF AUTOMATA WITH FUZZY STATES

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Weighted Regular Tree Grammars with Storage

  • Discrete Mathematics & Theoretical Computer Science
  • 2017
VIEW 3 EXCERPTS
CITES BACKGROUND

Weighted Turing machines over strong bimonoids

  • 2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)
  • 2015