Skip to main content
SpringerLink
Log in

Simple proof of algorithmic unsolvability of problems of completeness of automata bases

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature Cited

  1. N. E. Kobrinskii and B.A. Trakhtenbrot, Introduction to the Theory of Finite Automata [in Russian], Fizmatgiz, Moscow (1962).

    Google Scholar 

  2. M. I. Kratko, “Algorithmic unsolvability of the problem of recognition of completeness for finite automata,” Dokl. Akad. Nauk SSSR,155, No. 1 (1964).

  3. M. I. Kratko, “Existence of nonrecursive bases of finite automata,” in: Algebra i Logika, Seminar,3, No. 2 (1964).

  4. V. B. Kudryavtsev, “Powers of sets of precomplete sets of functional systems related to automata” in: Problems of Cybernetics, No. 13 [in Russian], Nauka, Moscow (1965).

    Google Scholar 

  5. I. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1965).

    Google Scholar 

  6. V. A. Orlov, “Complexity of realization of limited-deterministic operators by circuits in automata bases,” in: Problems of Cybernetics, No. 26 [in Russian], Nauka, Moscow (1972).

    Google Scholar 

  7. S. V. Yablonskii, “Functional constructions in k-valued logic,” Proc. Steklov Mathematics Institute, Vol. 51 [in Russian], Moscow (1958).

Download references

Authors
  1. V. A. Orlov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 109–113, July–August, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Orlov, V.A. Simple proof of algorithmic unsolvability of problems of completeness of automata bases. Cybern Syst Anal 9, 666–670 (1973). https://doi.org/10.1007/BF01068591

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01068591

Keywords

Search

Navigation