Polynomial-Time Algorithms for Testing Strong Isomorphism and Computing the Automorphism Group of R-Strongly Connected Automata.

Shuhua Zhang Polynomial-Time Algorithms for Testing Strong Isomorphism and Computing the Automorphism Group of R-Strongly Connected Automata. 263-277 1992 95 Theor. Comput. Sci. 2 db/journals/tcs/tcs95.html#Zhang92a