BISIMULATION MINIMIZATION OF TREE AUTOMATA
From MaRDI portal
Recommendations
Cites work
Cited in
(15)- Bisimulations and behaviour of nondeterministic automata
- Minimization of planar directed acyclic graph algebras
- COMPOSED BISIMULATION FOR TREE AUTOMATA
- Backward and Forward Bisimulation Minimisation of Tree Automata
- ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
- Some Minimality Results on Biresidual and Biseparable Automata
- Composed Bisimulation for Tree Automata
- scientific article; zbMATH DE number 139615 (Why is no real title available?)
- scientific article; zbMATH DE number 1339962 (Why is no real title available?)
- A congruence-based perspective on finite tree automata
- Tree process calculus
- On Transition Minimality of Bideterministic Automata
- scientific article; zbMATH DE number 7649889 (Why is no real title available?)
- Implementation and Application of Automata
- Backward and forward bisimulation minimization of tree automata
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 Q3503087)