Bisimulation Minimization of Tree Automata
From MaRDI portal
Publication:5757232
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)