Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems (Q4162481)
From MaRDI portal
scientific article; zbMATH DE number 3592967
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems |
scientific article; zbMATH DE number 3592967 |
Statements
Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems (English)
0 references
1978
0 references
