Minimizing deterministic weighted tree automata

DOI10.1016/j.ic.2009.01.004zbMath1192.68418OpenAlexW2132629030MaRDI QIDQ1041045

Andreas Maletti

Publication date: 27 November 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2009.01.004

zbMATH Keywords

determinismminimizationpartition refinementtree seriesweighted tree automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Similarity-based minimization of fuzzy tree automata ⋮ Minimisation of Multiplicity Tree Automata ⋮ Tree-Based Generation of Restricted Graph Languages ⋮ HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA ⋮ MINIMIZATION OF PLANAR DIRECTED ACYCLIC GRAPH ALGEBRAS

Uses Software

• OpenFst
• Tiburon
• FIRE station
• Carmel

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
• Learning tree languages from positive examples and membership queries
• Deciding Equivalence of Finite Tree Automata
• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• Backward and Forward Bisimulation Minimisation of Tree Automata
• Learning Deterministically Recognizable Tree Series — Revisited
• Minimizing Deterministic Weighted Tree Automata
• 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