Bisimulation Minimization of Tree Automata

DOI10.1007/11812128_17MaRDI QIDQ5757232zbMATH OpenOpenAlexFDO

Authors Lisa Kaati, Johanna Högberg, Parosh A. Abdulla

Publication date 6 September 2007

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11812128_17

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

• Backward and forward bisimulation minimization of tree automata
• Backward and Forward Bisimulation Minimisation of Tree Automata
• Bisimulation Minimisation for Weighted Tree Automata
• Bisimulation Minimisation of Weighted Automata on Unranked Trees
• Minimization of symbolic tree automata
• scientific article; zbMATH DE number 139615
• Composed Bisimulation for Tree Automata

Cited in

(11)

• ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
• Computing Simulations over Tree Automata
• A uniform (bi-)simulation-based framework for reducing tree automata
• Backward and forward bisimulation minimization of tree automata
• Bisimilarity Minimization in O(m logn) Time
• Some Minimality Results on Biresidual and Biseparable Automata
• Implementation and Application of Automata
• On Transition Minimality of Bideterministic Automata
• BISIMULATION MINIMIZATION OF TREE AUTOMATA
• Backward and Forward Bisimulation Minimisation of Tree Automata
• Simple bisimilarity minimization in \(O(m \log n)\) time

This page was built for publication: Bisimulation Minimization of Tree Automata

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