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

Degree of insolvability of algorithmic problems associated with group operation of automata

  • 11 Accesses

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

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Literature Cited

  1. 1.

    A. A. Letichevskii, “Equivalence of automata relative to semigroups,” in: Theoretical Cybernetics [in Russian], No. 6, Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1970).

  2. 2.

    A. A. Letichevskii and L. B. Smikun, “On a class of groups with solvable problems of equivalence of automata,” Dokl. Akad. Nauk SSSR,227, No. 1 (1976).

  3. 3.

    H. Rodgers, Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).

  4. 4.

    L. B. Smikun, “One method of proving the insolvability of the problem of equivalence of automata,” in: Questions of Designing Electronic Computers and Other Discrete Apparatus [in Russian], Inst. Kibernetiki Akad. Nauk UkrSSR, Kiev (1974).

Download references

Additional information

Translated from Kibernetika, No. 5, pp. 9–12, September–October, 1978.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Smikun, L.B. Degree of insolvability of algorithmic problems associated with group operation of automata. Cybern Syst Anal 14, 656–659 (1978). https://doi.org/10.1007/BF01069295

Download citation

Keywords

  • Operating System
  • Artificial Intelligence
  • System Theory
  • Group Operation
  • Algorithmic Problem