Literature Cited
M. Rabin and D. Scott, “Finite automata and their decision problems,” IBM J. Res. Develop.,3 (1959).
V. M. Glushkov and A. A. Letichevskii, “Theory of discrete transducers,” in: Selected Questions of Algebra and Logic [in Russian], Nauka, Novosibirsk (1973).
B. A. Trakhtenbrot, Complexity of Algorithms and Computations [in Russian], Izd. Novosibirsk. Univ., Novosibirsk (1967).
A. N. Kolodii, “Two-sided nondeterministic automata,” Kibernetika, No. 5 (1974).
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).
M. Bird, “The equivalence problem for deterministic two-tape automata,” J. Comput. Syst. Sci.,7, No. 2 (1973).
Additional information
Translated from Kibernetika, No. 2, pp. 9–14, March–April, 1977.
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01073301