Congruence and minimization of deterministic weighted finite automata
From MaRDI portal
Publication:2825075
Recommendations
Cited in
(8)- Minimal-determinization of weighted automaton
- Weighted finite automata over strong bimonoids
- Min-weighted and max-weighted power automata
- On the Complexity of Equivalence and Minimisation for Q-weighted Automata
- Weak Minimization of DFA — An Algorithm and Applications
- The minimal deterministic finite automaton recognizing the strong semilattice of finite monoids
- A Canonical Form for Weighted Automata and Applications to Approximate Minimization
- The relationships among several forms of weighted finite automata over strong bimonoids
This page was built for publication: Congruence and minimization of deterministic weighted finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2825075)