Automorphism groups and factor automata of strongly connected automata (Q1110336)
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: Automorphism groups and factor automata of strongly connected automata |
scientific article; zbMATH DE number 4072391
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Automorphism groups and factor automata of strongly connected automata |
scientific article; zbMATH DE number 4072391 |
Statements
Automorphism groups and factor automata of strongly connected automata (English)
0 references
1988
0 references
Strongly connected automata are studied in connection with their automorphism groups and factor automata. Group-matrix type automata introduced by M. Ito are used for a representation of strongly connected automata. Results and methods obtained are used to solve the following problem: Given a finite group G and a strongly connected automaton B. Is there a strongly connected automaton A with automorphism group Aut(A) isomorphic to G and the factor automaton of A by Aut(A) isomorphic to B ? The solution is not complete.
0 references
strongly connected automata
0 references
automorphism group
0 references
factor automaton
0 references
0.92253625
0 references
0.9078388
0 references
0 references
