Skip to main content
SpringerLink
Log in

Subclasses of Turing machines reducible to finite automata

  • 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. M. O. Rabin and D. Scott, “Finite automata and problems in their decomposition,” in: Cybernetics Collection, No. 4, [Russian translation], IL, Moscow (1962).

    Google Scholar 

  2. J. K. Shepherdson, “The reduction of two-sided automata to one-sided automata,” in: Cybernetics Collection No. 4 [Russian translation], IL, Moscow (1962).

    Google Scholar 

  3. B. A. Trakhtenbrot, The Complexity of Algorithms and Computations [in Russian], Izd-vo Novosibirskogo Gosuniversiteta (1967).

  4. Yu. Ya. Breitbart and V. A. Kozmidiadi, “Two subclasses of Turing machines reducible to finite automata,” Dokl. Akad. Nauk SSSR,187, No. 1, Moscow (1969).

  5. Rado, Bell System Tech. J.,41 (1962).

Download references

Authors
  1. Yu. Ya. Breitbart
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. A. Kozmidiadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This paper is a detailed description of the results announced in [4].

Translated from Kibernetika, No. 1, pp. 31–41, January–February, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Breitbart, Y.Y., Kozmidiadi, V.A. Subclasses of Turing machines reducible to finite automata. Cybern Syst Anal 8, 32–43 (1972). https://doi.org/10.1007/BF01069129

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation