Abstract
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(\hat{r}m \log n)\), where \(\hat{r}\) is the maximum rank of the input alphabet, m is the total size of the transition table, and n is the number of states.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdulla, P.A., Legay, A., d’Orso, J., Rezine, A.: Tree regular model checking: A simulation-based approach. Jour. of Logic and Alg. Programming (to appear, 2006)
Abdulla, P.A., Jonsson, B., Mahata, P., d’Orso, J.: Regular tree model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 555–568. Springer, Heidelberg (2002)
Abdulla, P.A., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 35–48. Springer, Heidelberg (2004)
Abdulla, P.A., Kaati, L., Högberg, J.: Minimization of tree automata. UMINF 06.25, Department of Computer Science, Umeå University (2006)
Biehl, M., Klarlund, N., Rauhe, T.: Algorithms for guided tree automata. In: Raymond, D.R., Yu, S., Wood, D. (eds.) WIA 1996. LNCS, vol. 1260. Springer, Heidelberg (1997)
Brainerd, W.S.: The minimalization of tree automata. Information and Computation 13, 484–491 (1968)
Cristau, J., Löding, C., Thomas, W.: Deterministic automata on unranked trees. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623. Springer, Heidelberg (2005)
Gramlich, G., Schnitger, G.: Minimizing nfa’s and regular expressions. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404. Springer, Heidelberg (2005)
Hopcroft, J.E.: An \(n \ log \ n\) algorithm for minimizing states in a finite automaton. In: Kohavi, Z. (ed.) Theory of Machines and Computations. Academic Press, London (1971)
Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions. In: Proc. 13th Ann. IEEE Symp. on Switching and Automata Theory, pp. 125–129 (1972)
Murata, M.: Hedge Automata: a Formal Model for XML Schemata. Web page (2000)
Nivat, M., Podelski, A.: Minimal ascending and descending tree automata. SIAM Journal on Computing 26, 39–58 (1997)
Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal on Computing 16, 973–989 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abdulla, P.A., Kaati, L., Högberg, J. (2006). Bisimulation Minimization of Tree Automata. In: Ibarra, O.H., Yen, HC. (eds) Implementation and Application of Automata. CIAA 2006. Lecture Notes in Computer Science, vol 4094. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11812128_17
Download citation
DOI: https://doi.org/10.1007/11812128_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37213-4
Online ISBN: 978-3-540-37214-1
eBook Packages: Computer ScienceComputer Science (R0)