Login / Signup
Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems.
Kellogg S. Booth
Published in:
SIAM J. Comput. (1978)
Keyphrases
</>
finite automata
np complete
graph theory
data analysis
regular expressions
graph isomorphism
database
expert systems
hidden markov models
decision problems
graph search