The equivalence problem for n-tape finite automata with simple cycles
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.
KeywordsNormal Form Span Tree Equivalence Problem Finite Automaton Inclusion Problem
Unable to display preview. Download preview PDF.
- M. Bird, The Equivalence Problem for Deterministic Two-Tape automata, Journal of Computer and System Sciences 7 (1973), 218–236.Google Scholar
- P.C. Fischer and A.L. Rosenberg, Multitape One-Way Nonwriting Automata, Journal of Computer and System Sciences 2 (1968), 88–101.Google Scholar
- S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).Google Scholar
- M.O. Rabin and D. Scott, Finite Automata and Their Decision Problems, IBM J. Res. Develop. 3 (1959), 114–125.Google Scholar