No label defined (Q4725756)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3999302
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3999302

      Statements

      1986
      0 references
      Strongly connected automata
      0 references
      automorphism groups
      0 references
      input sets
      0 references
      regular group-matrix type automata
      0 references
      0 references
      [For the entire collection see Zbl 0593.00024.] Strongly connected automata are considered in connection with their automorphism groups and input sets. \textit{M. Ito} [J. Comput. Syst. Sci. 17, 65-80 (1978; Zbl 0389.68032)] gives a representation of strongly connected automata, called regular group-matrix type automata. In this paper, we make further investigation on regular group-matrix type automata. Necessary and sufficient conditions for a group-matrix type automaton to be regular are given. We introduce a special type of representation, called normalized group-matrix type automata, which makes our theory more powerful. As an application, a relation among cardinalities of state sets, cardinalities of input sets, and automorphism groups of strongly connected automata is considered.
      0 references

      Identifiers