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

@article{Booth1978IsomorphismTF,
  title={Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems},
  author={Kellogg S. Booth},
  journal={SIAM J. Comput.},
  year={1978},
  volume={7},
  pages={273-279}
}

From This Paper

Topics from this paper.