Bisimulation Minimization of Tree Automata

DOI10.1007/11812128_17zbMATH Open1160.68395OpenAlexW2141408630MaRDI QIDQ5757232FDOQ5757232

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

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
• Minimisation of multiplicity tree automata
• Minimisation of multiplicity tree automata
• scientific article
• Composed Bisimulation for Tree Automata

Mathematics Subject Classification ID

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

Cited In (10)

• Some Minimality Results on Biresidual and Biseparable Automata
• A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata
• Backward and forward bisimulation minimization of tree automata
• ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
• BISIMULATION MINIMIZATION OF TREE AUTOMATA
• Implementation and Application of Automata
• Backward and Forward Bisimulation Minimisation of Tree Automata
• On Transition Minimality of Bideterministic Automata
• Computing Simulations over Tree Automata
• Bisimilarity Minimization in O(m logn) 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)