Minimal-determinization of weighted automaton

MaRDI QIDQ2994260zbMATH OpenFDO

Authors Meiling Pang, Yongming Li

Publication date 10 August 2016

zbMATH Keywords

cancellative \(d\)-semiringcomplete minimal algorithmcomplete minimal determinizationweighted automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• Minimizing Deterministic Weighted Tree Automata
• Minimizing deterministic weighted tree automata
• Congruence and minimization of deterministic weighted finite automata
• An improved algorithm for determinization of weighted and fuzzy automata
• Unweighted and weighted hyper-minimization

Cited in

(14)

• Minimizing deterministic weighted tree automata
• Minimization of graph weighted models over circular strings
• On deterministic weighted automata
• Words of minimum rank in deterministic finite automata
• A disambiguation algorithm for weighted automata
• Min-weighted and max-weighted power automata
• Congruence and minimization of deterministic weighted finite automata
• Determinations of weighted finite automata over commutative idempotent MF-semirings
• On the disambiguation of weighted automata
• A Canonical Form for Weighted Automata and Applications to Approximate Minimization
• On the Complexity of Equivalence and Minimisation for Q-weighted Automata
• Minimal weighted automata over the Galois field with two elements
• An improved algorithm for determinization of weighted and fuzzy automata
• Optimal run problem for weighted register automata

This page was built for publication: Minimal-determinization of weighted automaton

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2994260)