Automorphism groups and factor automata of strongly connected automata
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.
scientific article; zbMATH DE number 4072391
scientific article