Bisimulation Minimization of Tree Automata

We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree automata (NTA) with respect to bisimulation. We show that our algorithm has an overall complexity of O(ˆÖ Ñ log Ò), where ˆÖ is the maximum rank of the input alphabet, Ñ is the total size of the transition table, and Ò is the number of states.

• Type: Journal
• Year: 2007
• Where: IJFCS
• Authors: Parosh Aziz Abdulla, Johanna Högberg, Lisa Kaati
• Keywords: Algorithm, Coarsest Stable Refinement, IJFCS 2007, Non-deterministic Tree Automata