On the Determinization of Weighted Finite Automata

DOI10.1137/S0097539798346676zbMath1141.68495OpenAlexW2088663734MaRDI QIDQ4819882

Björn Borchardt, Heiko Vogler

Publication date: 5 October 2004

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

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

Mathematics Subject Classification ID

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

Related Items (13)

Crisp-determinization of weighted tree automata over strong bimonoids ⋮ Weighted tree automata and weighted logics ⋮ Compositions of tree series transformations ⋮ Unnamed Item ⋮ Minimizing Deterministic Weighted Tree Automata ⋮ Sequentiality of group-weighted tree automata ⋮ Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations ⋮ Cut sets as recognizable tree languages ⋮ Tree-Series-to-Tree-Series Transformations ⋮ Myhill-Nerode Theorem for Recognizable Tree Series Revisited ⋮ Kleene and Büchi theorems for weighted forest languages over M-monoids ⋮ Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition ⋮ Minimizing deterministic weighted tree automata

This page was built for publication: On the Determinization of Weighted Finite Automata