Skip to main content
SpringerLink
Log in

The equivalence of finite valued transducers (on HDTOL languages) is decidable

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1986 (MFCS 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 233))

Abstract

We show a generalization of the Ehrenfeucht Conjecture: For every language there exists a (finite) test set with respect to normalized k-valued finite transducers with bounded number of states. Further, we show that for each HDTOL language such a test set can be found effectively. As a corollary we solve an open problem by Gurari and Ibarra: The equivalence problem for finite valued finite transducers is decidable. This is the first time the equivalence problem is shown to be decidable for a larger class of multivalued transducers.

Short title: Finite valued transducers.

This work was supported by the Natural Sciences and Engineering Research Council of Canada under Grant A-7403.

This work has been done during the second author's visit at the University of Waterloo.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Albert, K. Culik II and J. Karhumäki, Test sets for context-free languages and algebraic systems of equations, Inform. Control 52(1982) 172–186.

    Google Scholar 

  2. M.H. Albert and J. Lawrence, A proof of Ehrenfeucht's Conjecture, Theoret. Comput. Sci. (to appear).

    Google Scholar 

  3. M.H. Albert and J. Lawrence, Test sets for finite substitutions, manuscript (1985).

    Google Scholar 

  4. J. Berstel, Transductions and Context-free Language (Teubner, Stuttgart, 1979).

    Google Scholar 

  5. M. Bird, The equivalence problem for deterministic two-tape automata, J. Comput. System Sci. 7(1973) 218–236.

    Google Scholar 

  6. M. Blattner and T. Head, Single-valued a-transducers, J. Comput. System Sci. 15(1977) 310–327.

    Google Scholar 

  7. M. Blattner and T. Head, The decidability of equivalence for deterministic finite transducers, J. Comput. System Sci. 19(1979) 45–49.

    Google Scholar 

  8. K. Culik II, Some decidability results about regular and pushdown translations, Inform. Process. lett. 8(1979) 5–8.

    Google Scholar 

  9. K. Culik II and I. Fris, The decidability of the equivalence problem for DOL-systems, Inform. Control 35(1977) 20–39.

    Google Scholar 

  10. 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 

  11. K. Culik II and J. Karhumäki, The decidability of the DTOL sequence equivalence problem and related decision problems, University of Waterloo, Department of Computer Science, Research Report CS-85-05 (1985).

    Google Scholar 

  12. K. Culik and J. Karhumäki, The equivalence problem for single-valued two-way transducers is decidable, University of Waterloo, Department of Computer Science, Research Report CS-85-24 (1985).

    Google Scholar 

  13. K. Culik II and J. Karhumäki, Decision problems solved with the help of the Ehrenfeucht Conjecture, EATCS Bull. 27 (1985) 30–35.

    Google Scholar 

  14. K. Culik II and J. Karhumäki, The equivalence of finite valued transducers (on HDTOL languages) is decidable, University of Waterloo, Department of Computer Science, Research Report CS-86-01 (1986).

    Google Scholar 

  15. K. Culik II and A. Salomaa, On the decidability of morphic equivalence for languages, J. Comput. System Sci. 17(1978) 163–175.

    Google Scholar 

  16. K. Culik II and A. Salomaa, Test sets and cfecking words hor homomorphism equivalence, J. Comput. System Sci. 15(1980) 375–395.

    Google Scholar 

  17. P.C. Fischer and A.L. Rosenberg, Multi-tape one-way nonwriting automata, J. Comput. System Sci. 2(1968) 88–101.

    Google Scholar 

  18. V.S. Guba, personal communication (1985).

    Google Scholar 

  19. E. Gurani, The equivalence problem for deterministic two-way transducers is decidable, SIAM J. Comput. 11(1982) 448–452.

    Google Scholar 

  20. E. Gurani, Two-way counter machines and finite-state transducers, Intern. J. Comput. Math. 17(1985) 229–236.

    Google Scholar 

  21. E. Gurani and O. Ibarra, A note on finite-valued and finitely ambiguous transducers, Math. Systems Theory 16(1983) 61–66.

    Google Scholar 

  22. T. Griffiths, The unsolvability of the equivalence problem for ∈-free nondeterministic generalized machines, J. Assoc. Comput. Mach. 15(1968) 409–413.

    Google Scholar 

  23. M.A. Harrison, Introduction to Formal Language Theory (Addison-Wesley, Reading, MA, 1982).

    Google Scholar 

  24. O. Ibarra, The unsolvability of the equivalence problem for ∈-free NGSM's with unary input (output) alphabet and applications, SIAM J. Comput. 4(1978) 524–532.

    Google Scholar 

  25. O. Ibarra, 2DST mappings on languages and related problems, Theoret. Comput. Sci. 19(1982) 219–227.

    Google Scholar 

  26. N. Jones and W. Laaser, Complete problems for deterministic polynomial time, Theoret. Comput. Sci. 3(1977) 105–117.

    Google Scholar 

  27. J. Karhumäki, The Ehrenfeucht Conjecture: A compactness claim for finitely generated free monoids, Theoret. Comput. Sci. 29(1984) 285–308.

    Google Scholar 

  28. J. Karhumäki and H.C.M. Kleijn, On the equivalence problem of compositions of morphisms and inverse morphisms, RAIRO Inform. Théor 19(1985) 203–211.

    Google Scholar 

  29. J. Lawrence, The non-existence of finite test sets for set-equivalence of finite substitutions, manuscript (1985).

    Google Scholar 

  30. Y. Maon, Decision problems concerning equivalence of transductions on languages, Ph.D. Thesis, Tel Aviv University (1985).

    Google Scholar 

  31. R. McNaughton, A proof of the Ehrenfeucht Conjecture, Informal Memorandum (1985).

    Google Scholar 

  32. E.F. Moore, Gedanken-experiments on sequential machines, in: Automata Studies (Princeton University Press, 1956).

    Google Scholar 

  33. D. Perrin, On the solution of Ehrenfeucht's Conjecture, EATCS Bull. 27(1985) 68–70.

    Google Scholar 

  34. A. Restivo and C. Reutenauer, On cancellation properties of languages which are supports of rational formal power series, J. Comput. System Sci. 22(1984) 153–159.

    Google Scholar 

  35. G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems (Academic Press, New York, 1980).

    Google Scholar 

  36. K. Ruohomen, Test sets for iterated morphisms, manuscript (1984).

    Google Scholar 

  37. A. Salomaa, The Ehrenfeucht Conjecture: A proof for language theorists, EATCS Bull. 27(1985) 71–82.

    Google Scholar 

  38. M.P. Schützenberger, Sur les relations rationnelles, in: Lecture Notes in Computer Science 33 (Springer, Berlin, 1975) 209–213.

    Google Scholar 

  39. J.R. Stallings, Finiteness properties of matrix representations, manuscript (1985).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Karel Culik II

  2. Department of Mathematics, University of Turku, Turku, Finland

    Juhani Karhumäki

Authors
  1. Karel Culik II
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juhani Karhumäki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Culik, K., Karhumäki, J. (1986). The equivalence of finite valued transducers (on HDTOL languages) is decidable. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016250

Download citation

  • DOI: https://doi.org/10.1007/BFb0016250

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation