Abstract
The equivalence problem for 2-tape deterministic finite automata was shown decidable by Bird in 1973, for n-tapes the problem is still open. We show that it is decidable for the restricted class of simple automata. An n-tape deterministic finite automaton is simple if at most one cycle goes through each of its states.
This research was supported by the Natural Sciences and Engineering Research Council of Canada Grant. No. A-7403
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Bird, The Equivalence Problem for Deterministic Two-Tape automata, Journal of Computer and System Sciences 7 (1973), 218–236.
P.C. Fischer and A.L. Rosenberg, Multitape One-Way Nonwriting Automata, Journal of Computer and System Sciences 2 (1968), 88–101.
S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).
O.H. Ibarra, Reversal-Bounded Multicounter Machines and Their Decision Problems, Journal ACM 25 (1978), 116–133.
O.H. Ibarra, The Unsolvability of the Equivalence Problem for ɛ-free NGSM's with Unary Input (Output) Alphabet and Applications, SIAM J. Comput. 7 (1978), 524–532.
M.O. Rabin and D. Scott, Finite Automata and Their Decision Problems, IBM J. Res. Develop. 3 (1959), 114–125.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Culik, K., Linna, M. (1987). The equivalence problem for n-tape finite automata with simple cycles. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18625-5_39
Download citation
DOI: https://doi.org/10.1007/3-540-18625-5_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18625-0
Online ISBN: 978-3-540-48033-4
eBook Packages: Springer Book Archive