On the Determinization of Weighted Finite Automata
From MaRDI portal
Publication:4819882
DOI10.1137/S0097539798346676zbMath1141.68495MaRDI QIDQ4819882
Publication date: 5 October 2004
Published in: SIAM Journal on Computing (Search for Journal in Brave)
68Q45: Formal languages and automata
68Q70: Algebraic theory of languages and automata
16Y60: Semirings
Related Items
Myhill-Nerode Theorem for Recognizable Tree Series Revisited, Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations, Weighted tree automata and weighted logics, Compositions of tree series transformations, Minimizing deterministic weighted tree automata, Cut sets as recognizable tree languages, Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition, Minimizing Deterministic Weighted Tree Automata, Tree-Series-to-Tree-Series Transformations