Decidability of equivalence for a class of non-deterministic tree transducers
RAIRO-Theor. Inf. Appl., 28 5 (1994) 447-463
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Branching synchronization grammars with nested tables
Frank Drewes and Joost EngelfrietJournal of Computer and System Sciences 68 (3) 611 (2004)
https://doi.org/10.1016/j.jcss.2003.10.001
Decidability of the Finiteness of Ranges of Tree Transductions
Frank Drewes and Joost EngelfrietInformation and Computation 145 (1) 1 (1998)
https://doi.org/10.1006/inco.1998.2715
On the equivalence problem for letter-to-letter top-down tree transducers
Yves Andre and Francis BossutTheoretical Computer Science 205 (1-2) 207 (1998)
https://doi.org/10.1016/S0304-3975(97)00080-7
TAPSOFT '95: Theory and Practice of Software Development
Yves Andre and Francis BossutLecture Notes in Computer Science, TAPSOFT '95: Theory and Practice of Software Development 915 155 (1995)
https://doi.org/10.1007/3-540-59293-8_193