Sciweavers

FCT
2009
Springer

Equivalence of Deterministic Nested Word to Word Transducers

13 years 10 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 4 equivalence problems for diverse classes of deterministic non-copying order-preserving transducers. In particular, we present polynomial time back and fourth reductions to the morphism equivalence problem on context free languages, which is known to be solvable in polynomial time.
Slawomir Staworko, Grégoire Laurence, Aur&e
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where FCT
Authors Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren
Comments (0)