Congruence and minimization of deterministic weighted finite automata
From MaRDI portal
Publication:2825075
DOI10.3969/J.ISSN.1008-5513.2015.05.005zbMATH Open1363.18003MaRDI QIDQ2825075FDOQ2825075
Publication date: 6 October 2016
Published in: Pure and Applied Mathematics (Search for Journal in Brave)
Recommendations
Cited In (8)
- On the Complexity of Equivalence and Minimisation for Q-weighted Automata
- Weighted finite automata over strong bimonoids
- The minimal deterministic finite automaton recognizing the strong semilattice of finite monoids
- A Canonical Form for Weighted Automata and Applications to Approximate Minimization
- Min-weighted and max-weighted power automata
- Minimal-determinization of weighted automaton
- Weak Minimization of DFA — An Algorithm and Applications
- 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)