Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

On the semigroup of endomorphisms of a finite automaton

  • 8 Accesses

This is a preview of subscription content, log in to check access.

Literature Cited

  1. 1.

    F. Gečeg and I. Peăk, ‘Automata and semigroups, Part II”, Acta Sci. Math., 26, (1, 2) (1965).

  2. 2.

    R. Bayer, “Endomorphism and congruence of automata”, IEEE Conf. Rec. Eighth Annual Sympos. Switching and Automata Theory, Austin, Texas (1967).

Download references

Additional information

Translated from Kibernetika, No. 2, pp. 56–57, March–April, 1971.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Amkhinich, V.Z. On the semigroup of endomorphisms of a finite automaton. Cybern Syst Anal 7, 268–269 (1971). https://doi.org/10.1007/BF01071795

Download citation

Keywords

  • Operating System
  • Artificial Intelligence
  • System Theory
  • Finite Automaton