The equivalence problem for n-tape finite automata with simple cycles

  • Karel CulikII
  • Matti Linna
Session 1 Automata And Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 287)


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.


Normal Form Span Tree Equivalence Problem Finite Automaton Inclusion Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    M. Bird, The Equivalence Problem for Deterministic Two-Tape automata, Journal of Computer and System Sciences 7 (1973), 218–236.Google Scholar
  2. [2]
    P.C. Fischer and A.L. Rosenberg, Multitape One-Way Nonwriting Automata, Journal of Computer and System Sciences 2 (1968), 88–101.Google Scholar
  3. [3]
    S. Ginsburg, The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York (1966).Google Scholar
  4. [4]
    O.H. Ibarra, Reversal-Bounded Multicounter Machines and Their Decision Problems, Journal ACM 25 (1978), 116–133.CrossRefGoogle Scholar
  5. [5]
    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.CrossRefGoogle Scholar
  6. [6]
    M.O. Rabin and D. Scott, Finite Automata and Their Decision Problems, IBM J. Res. Develop. 3 (1959), 114–125.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Karel CulikII
    • 1
  • Matti Linna
    • 2
  1. 1.Department of Computer ScienceUniversity of South CarolinaColumbiaUSA
  2. 2.Department of MathematicsUniversity of TurkuTurkuFinland

Personalised recommendations