Skip to main content
SpringerLink
Log in

Decidability of equivalence for linear letter to letter top-down tree transducers

  • Communications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1993)

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

Included in the following conference series:

Abstract

In this paper we consider non deterministic linear top-down tree transducers in the letter to letter case, that is to say tree transducers for which trees which appear in the rules are reduced to one letter in the right-hand side as in the left one. We establish the decidability of equivalence for this class of transducers.

Supported in part by the PRC-GDR “Mathématiques et Informatique” and the Basic Research Working Group ESPRIT 6317 ASMICS II

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. L. Boasson and J.M. Autebert. Transductions rationnelles. Applications aux langages algébriques. Collection ERI, Masson. 1988.

    Google Scholar 

  2. A. Arnold and M. Dauchet. Morphismes et bimorphismes d'arbres. Theorical Computer Science 20. 1982.

    Google Scholar 

  3. Y. André and M. Dauchet. Decidability of equivalence for a class of non deterministic tree transducers. Publication IT-243 LIFL. University of Lille. 1992. Submitted to Rairo.

    Google Scholar 

  4. J. Berstel. Transductions and context-free languages. Teubner Verlag Stuttgart, 1979.

    Google Scholar 

  5. S. Bozapalidis. Alphabetic tree relations. TCS 99. pp 177–211. 1992.

    Article  Google Scholar 

  6. J. Doner. Tree acceptors and some of their applications. Journal Computer System Science 4, pp 406–451. 1970.

    Google Scholar 

  7. J. Engelfriet. Bottom-up and top-down tree transformations: a comparison. Mathematical system theory. Vol 9. pp 198–231. 1975.

    Article  Google Scholar 

  8. J. Engelfriet. Top-down tree transducers with regular look-ahead. Mathematical System Theory. Vol 10. pp 289–303. 1977.

    Article  Google Scholar 

  9. Z. Esik. Decidability results concerning tree transducers I. Acta Cybernetica, Tom. 5, Fasc. 1, pp 1–20, Szeged, 1980.

    Google Scholar 

  10. F. Gecseg and M. Steinby. Tree automata. Akademiai Kiado, Budapest. 1984.

    Google Scholar 

  11. H. Seidl. Equivalence of finite-valued bottom-up finite state tree transducers is decidable. Proceeding of CAAP 90, pp 269–284.

    Google Scholar 

  12. Z. Zachar. The solvability of the equivalence problem for deterministic frontier-to-root tree transducers. Acta Cybernetica, v.4, 1978, pp 167–177.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.F.L., U.R.A. 369 C.N.R.S., University of Lille 1, 59655, Villeneuve d'Ascq Cedex, France

    Yves Andre & Francis Bossut

Authors
  1. Yves Andre
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francis Bossut
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andre, Y., Bossut, F. (1993). Decidability of equivalence for linear letter to letter top-down tree transducers. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-57163-9_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57163-6

  • Online ISBN: 978-3-540-47923-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation