Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of \(R\)-strongly connected automata (Q1184982)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of \(R\)-strongly connected automata |
scientific article; zbMATH DE number 35360
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of \(R\)-strongly connected automata |
scientific article; zbMATH DE number 35360 |
Statements
Polynomial-time algorithms for testing strong isomorphism and computing the automorphism group of \(R\)-strongly connected automata (English)
0 references
28 June 1992
0 references
graph isomorphism problem
0 references
isomorphism-complete problems
0 references
Polynomial-time algorithms
0 references
strong isomorphism
0 references
automorphism group of \(R\)-strongly connected automata
0 references
