Skip to main content
Log in

Comparison of two-sided automata with respect to operating time and decidability in the problem of functional equivalence in a certain class of discrete transducers and program schemes 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

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

Instant access to the full article PDF.

Literature Cited

  1. M. Rabin and D. Scott, “Finite automata and their decision problems,” IBM J. Res. Develop.,3 (1959).

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

    Google Scholar 

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

    Google Scholar 

  4. A. N. Kolodii, “Two-sided nondeterministic automata,” Kibernetika, No. 5 (1974).

  5. S. K. Shukuryan, “The decidability of the equivalence problem in one class of multitape multihead automata and program schemes over memory,” Kibernetika, No. 4 (1976).

  6. M. Bird, “The equivalence problem for deterministic two-tape automata,” J. Comput. Syst. Sci.,7, No. 2 (1973).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 2, pp. 9–14, March–April, 1977.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shukuryan, S.K. Comparison of two-sided automata with respect to operating time and decidability in the problem of functional equivalence in a certain class of discrete transducers and program schemes over memory. Cybern Syst Anal 13, 152–159 (1977). https://doi.org/10.1007/BF01073301

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation