Isomorphisms of group‐matrix type automata
Masashi Katsura · Systems and Computers in Japan · 1987
Abstract This paper discusses the representation of the strongly connected automaton. Any strongly connected automaton is isomorphic to a regular group‐matrix type automaton on its automorphism group. This paper discusses the isomorphisms among strongly connected group‐matrix type automata. When a finite group G and a strongly connected automaton B are given, a set of representatives of isomorphism classes of strongly connected automata is constructed, in which the factor automaton by the automorphism group is isomorphic to B.