Skip to main content
SpringerLink
Log in

Decidability of the equivalence problem for A class of multitape multihead automata and flowcharts over memory

  • 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. V. M. Glushkov and A. A. Letichevskii, “The theory of discrete processors,” in: Selected Questions in Algebra and Logic [in Russian], Nauka, Sibirsk. Otd., Novosibirsk (1973).

    Google Scholar 

  2. D. C. Luckham, D.M.R. Park, and M. S. Paterson, “On formalized computer programs,” J. Comput. Syst. Sci.,4, No. 3 (1970).

    Google Scholar 

  3. V. A. Nepomnyashchii, “On certain automata able to compute a basis for recursively computable sets,” Algebra i Logika,5, No. 5 (1966).

    Google Scholar 

  4. B. A. Trakhtenbrot, Complexity of Algorithms and Computations [in Russian], Izd. Novosibirsk. Gosuniv. (1967).

Download references

Authors
  1. S. K. Shukuryan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 12–16, July–August, 1976.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shukuryan, S.K. Decidability of the equivalence problem for A class of multitape multihead automata and flowcharts over memory. Cybern Syst Anal 12, 507–512 (1976). https://doi.org/10.1007/BF01070381

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation