Sciweavers

FCT
2009
Springer
14 years 6 months ago
Equivalence of Deterministic Nested Word to Word Transducers
We study the equivalence problem of deterministic nested word to word transducers and show it to be suprisingly robust. Modulo polynomal time reductions, it can be identified with...
Slawomir Staworko, Grégoire Laurence, Aur&e...