Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of R-strongly connected automata

Shuhua Zhang
1992 Theoretical Computer Science  
Zhang, S., Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of R-strongly connected automata, Theoretical Computer Science 95 (1992) 263-277. An automaton A=(& Z, M) is said to be R-strongly connected if for every soS, R(s)=(r(s), Z, M,) is strongly connected, where r(s) = { M( , s x )I x EZ + } and M, is the map M restricted to r(s) x .X. The class of R-strongly connected automata includes strongly connected, permutation, group type,
more » ... nt and right simple type automata. Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of R-strongly connected automata are given. 0304-3975/92/$05.00 0 1992-Elsevier Science Publishers B.V. All rights reserved
doi:10.1016/0304-3975(92)90268-k fatcat:hwlo5g455ram3g26pu7caaihsa