… On deterministic tree automata, composed bisimulation minimization will coincide with
our forward bisimulation minimization. As before, let M = (Q,Σ,δ,F) be an fta for the rest of this …

… that minimizes non-deterministic tree automata with respect to bisimulation equivalence in
… and Tarjan proposed in [18] to the domain of trees. Since the time complexity reduces to 0(m …

… bisimulation minimisation for wsuta and wputa, which is obtained by reducing the problem to
bisimulation minimisation … (resp., backward) bisimulation minimal wsuta can be computed in …

… that minimizes non-deterministic tree automata with respect to bisimulation equivalence in
… algorithm proposed in [13] to the domain of trees. Since the time complexity reduces to O(m …

… In theory, one can always determinise and minimise any given (bottom-up) tree automaton.
However, the determinisation step may lead to an exponential blow-up in the size of the …

… We compute bisimulation using an algorithm due to Lee and Yannakakis that represents
bisimulation … We demonstrate that bisimulation is practical for many designs within the automata-…

… ) tree automata. We propose a uniform framework that allows for combining various upward
and downward bisimulation … a bisimulation-based minimisation of weighted word automata, …

… [2], where a similar notion is used to compute bisimulations of non-deterministic tree
automata. Thanks to this reduction we can directly use the efficient s-FA minimization algorithm …

… probabilistic automata model and the weak probabilistic bisimulation. Then, in Sect. 4, we
show how to compute the weak probabilistic bisimulation and how to minimize an automaton. …

… We improve an existing bisimulation minimisation algorithm for tree automata by … bisimulations
and developing minimisation algorithms for them. Minimisation via forward bisimulation is …