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 nondeterministic tree automata (NTA) with res ...

[1]  Parosh Aziz Abdulla,et al.  A Survey of Regular Model Checking , 2004, CONCUR.

[2]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[3]  Walter S. Brainerd,et al.  The Minimalization of Tree Automata , 1968, Inf. Control..

[4]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[5]  Amir Pnueli,et al.  Symbolic model checking with rich assertional languages , 2001, Theor. Comput. Sci..

[6]  Aurélien Lemay,et al.  Residual Finite State Automata , 2002, Fundam. Informaticae.

[7]  Andreas Podelski,et al.  Minimal Ascending and Descending Tree Automata , 1997, SIAM J. Comput..

[8]  Frank Neven,et al.  Automata, Logic, and XML , 2002, CSL.

[9]  Parosh Aziz Abdulla,et al.  Tree regular model checking: A simulation-based approach , 2006, J. Log. Algebraic Methods Program..

[10]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.