Skip to main content
SpringerLink
Log in

Solvable problems for transformers with reversal-bounded counters

  • 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. L. P. Lisovik, “Rigid sets and finite coverings of semigroups,” Kibernetika, No. 1, 12–16 (1980).

    Google Scholar 

  2. V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transformers,” in: Selected Aspects of Algebra and Logic [in Russian], Nauka, Novosibirsk (1973).

    Google Scholar 

  3. V. N. Red'ko and L. P. Lisovik, “Equivalence problems for reversal-bounded counter machines,” Kibernetika, No. 4 26–28 (1980).

    Google Scholar 

  4. S. Ginzburg, Mathematical Theory of Context-Free Languages [Russian translation], Mir, Moscow (1970).

    Google Scholar 

  5. L. P. Lisovik, “Equivalence problem for transformers on Σ-trees with reversal-bounded counters,” Kibernetika, No. 5, 19–24 (1984).

    Google Scholar 

  6. A. P. Bel'tyukov, “Solvability of the universal theory of natural numbers with addition and divisibility,” in: Proceedings of LOMI Seminars [in Russian] (1976), pp. 15–28.

  7. A. A. Letichevskii, “Equivalence of automata with respect to semigroups,” Teor. Kibern., No. 6, 3–62 (1970).

    Google Scholar 

  8. A. A. Letichevskii, “Equivalence of the finite-state automata with respect to right-zero semigroup,” Dokl. Akad. Nauk SSSR,182, No. 5, 1007–1009 (1968).

    Google Scholar 

  9. Yu. V. Matiyasevich, “Diophantine property of enumerable sets,” Dokl. Akad. Nauk SSSR,191, No. 2, 279–282 (1970).

    Google Scholar 

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

    Google Scholar 

  11. O. H. Ibarra, “Reversal-bounded multicounter machines and their decision problems,” J. ACM,25, No. 1, 116–133 (1978).

    Google Scholar 

  12. L. Lipshitz, “The Diophantine problem for addition and divisibility,” Trans. Am. Math. Soc.,235, No. 1, 271–283 (1978).

    Google Scholar 

  13. M. L. Minsky, “Recursive unsolvability of Post's problem of ‘TAG’ and topics in theory of Turing machines,” Ann. Math.74, 437–455 (1961).

    Google Scholar 

  14. V. N. Red'ko and L. P. Lisovik, “Regular events in semigroups,” Probl. Kibern., No. 37, 155–184 (1980).

    Google Scholar 

Download references

Authors
  1. A. P. Lisovik
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 1–8, May–June, 1985.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lisovik, A.P. Solvable problems for transformers with reversal-bounded counters. Cybern Syst Anal 21, 275–284 (1985). https://doi.org/10.1007/BF01078820

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation