Kellogg S. Booth. Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems. SIAM Journal on Computing, 7(3):273-279, 1978.
@article{Booth78, title = {Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems}, author = {Kellogg S. Booth}, year = {1978}, tags = {testing, graph-rewriting, rewriting}, researchr = {https://researchr.org/publication/Booth78}, cites = {0}, citedby = {0}, journal = {SIAM Journal on Computing}, volume = {7}, number = {3}, pages = {273-279}, }