The equivalence problem for single-valued two-way transducers (on NPDTOL languages) is decidable

Economy of description for basic constructions on rational transductions

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems

The equivalence problem for deterministic MSO tree transducers is decidable

Information Processing Letters

The equivalence problem for deterministic MSO tree transducers is decidable

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science

From Two-Way to One-Way Finite State Transducers

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science