Decidability of equivalence for linear letter to letter top-down tree transducers
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.
Unable to display preview. Download preview PDF.
- L. Boasson and J.M. Autebert. Transductions rationnelles. Applications aux langages algébriques. Collection ERI, Masson. 1988.Google Scholar
- A. Arnold and M. Dauchet. Morphismes et bimorphismes d'arbres. Theorical Computer Science 20. 1982.Google Scholar
- 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
- J. Berstel. Transductions and context-free languages. Teubner Verlag Stuttgart, 1979.Google Scholar
- J. Doner. Tree acceptors and some of their applications. Journal Computer System Science 4, pp 406–451. 1970.Google Scholar
- Z. Esik. Decidability results concerning tree transducers I. Acta Cybernetica, Tom. 5, Fasc. 1, pp 1–20, Szeged, 1980.Google Scholar
- F. Gecseg and M. Steinby. Tree automata. Akademiai Kiado, Budapest. 1984.Google Scholar
- H. Seidl. Equivalence of finite-valued bottom-up finite state tree transducers is decidable. Proceeding of CAAP 90, pp 269–284.Google Scholar
- 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