On the Determinization of Weighted Finite Automata

DOI10.1137/S0097539798346676zbMath0980.68065MaRDI QIDQ2706122

Raffaele Giancarlo, Jeffery Westbrook, Adam L. Buchsbaum

Publication date: 19 March 2001

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539798346676

zbMATH Keywords

algorithms; speech recognition; weighted automata; rational functions and power series

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

68T10: Pattern recognition, speech recognition

20M35: Semigroups in automata theory, linguistics, etc.

Related Items

Unnamed Item, Weighted Automata and Weighted Logics, Diagnosis and Automata, Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure, Rigorous approximated determinization of weighted automata, Determinization of fuzzy automata via factorization of fuzzy states, An improved algorithm for determinization of weighted and fuzzy automata, Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton, Weighted automata and weighted logics with discounting, Weighted finite automata over strong bimonoids, Skew and infinitary formal power series, Weighted tree automata and weighted logics, Noncommutative rational Pólya series, Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders, TFHE: fast fully homomorphic encryption over the torus, Trimming visibly pushdown automata, Weighted automata and weighted logics, Sequential?, On quotients of formal power series, A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata