Skip to main content
SpringerLink
Log in

Decidability problems for graph-schemes with permutation operators. I

  • 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. A. P. Ershov and A. A. Lyapunov, “On the formalization of the concept of program,” Kibernetika, No. 5 (1967).

  2. L. A. Kaluzhnin, “On the algorithmization of mathematical problems,” Problems of Cybernetics [in Russian], No. 2, Moscow (1959).

  3. S. S. Lavrov, “On memory economy in closed operator schemes,” Zh. Vychisl. Matem. i Matem. Fiz.,1, No. 4 (1961).

  4. V. V. Martynyuk, “On economical memory allocation,” Zh. Vychisl. Matem. i Matem. Fiz.,2, No. 3 (1962).

  5. A. P. Ershov, “Reduction of the memory allocation problem in programming to the problem of coloring the nodes of graphs,” Dokl. Akad. Nauk SSSR,142, No. 4 (1962).

  6. V. V. Martynyuk, “On the analysis of the transition graph for an operator scheme,” Zh. Vychisl. Matem. i Matem. Fiz.,5, No. 2 (1965).

  7. V. V. Martynyuk, “Determination of chains in algorithm schemes,” Zh. Vychisl. Matem. i Matem. Fiz.1, No. 1 (1961).

  8. Yu. I. Smirnov, “On the transformation of operator schemes,” Zh. Vychisl. Matem. i Matem. Fiz.,3, No. 3 (1963).

  9. Yu. I. Smirnov, “On the construction of the prohibition matrix of an operator scheme with library callup,” Zh. Vychisl. Matem. i Matem. Fiz.,4, No. 1 (1964).

  10. Yu. I. Yanov, “On logical schemes of algorithms,” Problemy Kibernetiki, No. 1 (1958).

  11. V. A. Tuzov, “Equivalence of logical schemes with permutable operators,” Kibernetika, No. 6 (1970).

  12. R. J. Parikh, “On context-free languages,” Journal of the ACM,13, No. 4 (1968).

  13. V. N. Red'ko, “On an algebra of commutative events,” Ukrainsk. Matem. Zh.,16, No. 2 (1967).

  14. M. O. Rabin and D. Scott, “Finite automata and their decision problems,” IBM J. Res. Develop.,3, 114–125 (1959).

    Google Scholar 

  15. C. C. Elgot and J. D. Rutledge, “RS-machines with almost blank tape,” Journal of the ACM11 No. 3 (1964).

  16. M. Presburger, “Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen in welchem die Addition als einzige Operation hervortritt,” Comptes rendus du Ie Congress des Mathematiciens des Pays slaves, Warsaw (1929).

  17. D. Hilbert and P. Bernays, Grundlagen der Mathematik, Edwards Brothers Int., Ann Arbor (1944).

    Google Scholar 

  18. C. C. Elgot and J. E. Mezei, “On finite relations defined by generalized automata,” IBM J. Res. Develop.,9 (1965).

  19. P. Fisher, “Multitape and infinite automata (survey)” Cybernetic Collection [Russian translation], No. 5, New Series, Mir, Moscow (1968).

    Google Scholar 

  20. E. Post, “A variant of recursively unsolvable problems,” Bulletin of the American Mathematical Society,52 (1946).

  21. A. A. Markov, Theory of Algorithms, Trans. of the V. A. Steklov Mathematical Institute [in Russian], Vol. 17, Moscow (1954).

  22. P. S. Landweber, “Decision problems of phrase-structure grammers,” IEEE Trans. Electron. Computers EC-14, 354–362 (1964).

    Google Scholar 

  23. N. Chomsky, “On certain formal properties of grammars” Inform. Control,2, 137–167 (1959).

    Google Scholar 

Download references

Authors
  1. V. A. Tuzov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 30–38, July–August, 1971.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tuzov, V.A. Decidability problems for graph-schemes with permutation operators. I. Cybern Syst Anal 7, 608–618 (1971). https://doi.org/10.1007/BF01071032

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation