Bisimulation Minimisation of Weighted Automata on Unranked Trees

DOI10.3233/FI-2009-0068zbMath1191.68388OpenAlexW1926676550MaRDI QIDQ3635993

Andreas Maletti, Johanna Högberg, Heiko Vogler

Publication date: 30 June 2009

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2009-0068

zbMATH Keywords

minimisation problemunranked tree automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics ⋮ Ambiguity Hierarchies for Weighted Tree Automata ⋮ Minimization of Finite State Automata Through Partition Aggregation ⋮ Aggregation-based minimization of finite state automata ⋮ Ambiguity hierarchies for weighted tree automata