Bisimulation Minimisation of Weighted Automata on Unranked Trees

DOI10.3233/FI-2009-0068MaRDI QIDQ3635993zbMATH OpenOpenAlexFDO

Authors Johanna Högberg, Andreas Maletti, 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)

Recommendations

• Bisimulation Minimisation for Weighted Tree Automata
• Minimizing Deterministic Weighted Tree Automata
• Backward and Forward Bisimulation Minimisation of Tree Automata
• Backward and forward bisimulation minimization of tree automata
• Minimizing deterministic weighted tree automata

Cited in

(11)

• Bisimulation Minimization of Tree Automata
• On the minimization of XML schemas and tree automata for unranked trees
• Minimization of finite state automata through partition aggregation
• Aggregation-based minimization of finite state automata
• Weighted unranked tree automata over tree valuation monoids and their characterization by weighted logics
• A Backward and a Forward Simulation for Weighted Tree Automata
• Ambiguity Hierarchies for Weighted Tree Automata
• Bisimulation Minimisation for Weighted Tree Automata
• Backward and Forward Bisimulation Minimisation of Tree Automata
• Ambiguity hierarchies for weighted tree automata
• Database Programming Languages

This page was built for publication: Bisimulation Minimisation of Weighted Automata on Unranked Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3635993)