Single-valuedness of tree transducers is decidable in polynomial time
- 30 November 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 106 (1) , 135-181
- https://doi.org/10.1016/0304-3975(92)90281-j
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the valuedness of finite transducersActa Informatica, 1990
- Deciding Equivalence of Finite Tree AutomataSIAM Journal on Computing, 1990
- On the finite degree of ambiguity of finite tree automataActa Informatica, 1989
- The equivalence of finite valued transducers (on HDT0L languages) is decidableTheoretical Computer Science, 1986
- Attribute grammars and recursive program schemes ITheoretical Computer Science, 1982
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Sur les relations rationnelles entre monoides libresTheoretical Computer Science, 1976