1. Hopcroft, J.E.: An
$n\,\textrm{log}\, n$
algorithm for minimizing states in a finite automation. In: Kohavi, Z. (ed.) Theory of Machines and Computations, Academic Press, London (1971)
2. Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proc. 13th Annual Symp. Foundations of Computer Science, pp. 125–129. IEEE Computer Society Press, Los Alamitos (1972)
3. Lecture Notes in Computer Science;G. Gramlich,2005
4. Abdulla, P.A., Högberg, J., Kaati, L.: Bisimulation minimization of tree automata. In: IJFCS (2007)
5. Lecture Notes in Computer Science;P.A. Abdulla,2002