Abstract
The notion of closed diagram is applied to formulate a condition of equivalence of three-tape deterministic automata and to prove its sufficiency. The construction of an algorithm to decide the equivalence is such automata based on closed diagrams is demonstrated with examples.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
M. O. Rabin and D. Scott, “Finite automata and their decision problems,” IBM J. Tech. Res. Dev.,3, No. 2, 114–125 (1959).
M. S. Paterson, “Decidability problems in computation models,” in: Programming Theory [in Russian], Vol. 2 VTs Sib. Otd. Akad Nauk SSSR, Novosibirsk (1972), pp. 119–136.
M. Bird, “The equivalence problem for determinstic multi-tape automata,” J. Comp. Syst. Sci.,7, No. 3, 218–236 (1973).
V. I. Borisenko, Decidability of Equivalence of Three-Tape Automata [in Russian], Inst. Kiber. Akad Nauk UkrSSR, Kiev (1988). Unpublished manuscript, VINITI 20.01.89, No. 462-V89.
Additional information
Translated from Kibernetika, No. 3, pp. 17–22, May–June, 1991.
Rights and permissions
About this article
Cite this article
Borisenko, V.I. Sufficient conditions of equivalence of three-tape automata. Cybern Syst Anal 27, 332–339 (1991). https://doi.org/10.1007/BF01068313
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068313