Minimizing Deterministic Weighted Tree Automata

DOI10.1007/978-3-540-88282-4_33zbMath1157.68041OpenAlexW4245153043MaRDI QIDQ3540127

Andreas Maletti

Publication date: 20 November 2008

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_33

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Similarity-based minimization of fuzzy tree automata ⋮ Applications of Weighted Automata in Natural Language Processing ⋮ Minimizing deterministic weighted tree automata

Uses Software

• Tiburon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The rank of a formal tree power series
• Effective construction of the syntactic algebra of a recognizable series on trees
• Learning regular sets from queries and counterexamples
• Equational elements in additive algebras
• Minimization algorithms for sequential transducers
• Deciding Equivalence of Finite Tree Automata
• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• Learning Deterministically Recognizable Tree Series — Revisited
• Learning Multiplicity Tree Automata
• On the Determinization of Weighted Finite Automata
• Implementation and Application of Automata
• Implementation and Application of Automata
• Tiburon: A Weighted Tree Automata Toolkit

This page was built for publication: Minimizing Deterministic Weighted Tree Automata