On the equivalence problem for deterministic multitape automata and transducers

  • Karel CulikII
  • Juhani Karhumäki
Contributed Papers Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 349)


We discuss the technique for testing the equivalence of two deterministic automata by constructing a language that matches the computations of two equivalent automata on the same input word. Specifically, we propose to use HDTOL languages that are powerful enough to match computations of many equivalent deterministic multitape automata, and at the same time, have nice decidable properties. Using this new technique of HDTOL matching, we show that the inclusion problem between an arbitrary deterministic multitape automaton and a simple one is decidable in both directions. Further, we show that the computations of two simple automata can be HDTOL matched on their common domain. This implies that the equivalence problem for transducers based on simple automata is decidable. The latter result is the best possible since the problem is undecidable even for transducers based on automata with parallel loops.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. Berstel, Transductions and Context-Free Languages, Teubner, Stuttgart, 1979.Google Scholar
  2. [2]
    M. Bird, The equivalence problem for deterministic two-tape automata, J. Comput. Sci. 7 (1973) 218–236.Google Scholar
  3. [3]
    K. Culik II, A purely homomorphic characterization of recursively enumerable sets, J. Assoc. Comput. Mach. 6 (1979) 345–350.Google Scholar
  4. [4]
    K. Culik II and J. Karhumäki, Systems of equations over a free monoid and Ehrenfeucht's conjecture, Discrete Math. 43 (1983) 139–153.Google Scholar
  5. [5]
    K. Culik II and J. Karhumäki, The equivalence of finite valued transducers (on HDTOL languages) is decidable, Theoret. Comput. Sci. 47 (1986) 71–84.Google Scholar
  6. [6]
    K. Culik II and J. Karhumäki, Systems of equations over a finitely generated free monoid having an effectively findable equivalent finite subsystem, in: H.Jurgensen, G.Lallement and H.Weinert (eds), Semigroups Theory and Applications, Oberwolfach 1986, Lecture Notes in Mathematics 1320, pp. 18–27 (Springer, 1988).Google Scholar
  7. [7]
    K. Culik II and J. Karhumäki, Loops in automata and HDTOL relations, Technical Report TR88003, USC (1988).Google Scholar
  8. [8]
    K. Culik II and J. Karhumäki, HDTOL matching of computations of multitape automata, Technical Report TR88004, USC (1988).Google Scholar
  9. [9]
    K. Culik II and A. Salomaa, On the decidability of morphic equivalence for languages, J. Comput. System Sci. 17 (1978) 163–175.Google Scholar
  10. [10]
    M. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, 1978.Google Scholar
  11. [11]
    E. Kinber, The inclusion problem for some classes of deterministic multitape automata, Theoret. Comput. Sci. 26 (1983) 1–24.Google Scholar
  12. [12]
    H. R. Lewis, A new decidability problem with applications, Proceedings of 18th FOCS Conference (1979) 62–73.Google Scholar
  13. [13]
    M. Rabin and D. Scott, Finite automata and their decision problems, IBM J. Res. Develop. 3 (1959) 114–125.Google Scholar
  14. [14]
    G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems, Academic Press, New York, 1980.Google Scholar
  15. [15]
    L. G. Valiant, The equivalence problem for deterministic finite-turn pushdown automata, Inform. Control 25 (1974) 123–133.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Karel CulikII
    • 1
  • Juhani Karhumäki
    • 2
  1. 1.Dept.of Computer ScienceUniversity of South CarolinaColumbiaUSA
  2. 2.Department of MathematicsUniversity of TurkuTurkuFinland

Personalised recommendations