Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems

Kellogg S. Booth. Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems. SIAM Journal on Computing, 7(3):273-279, 1978.

Abstract

Abstract is missing.