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.

• Type: Conference
• Year: 2009
• Where: FCT
• Authors: Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren
• Keywords: Deterministic Nested Word, Equivalence Problem, FCT 2009, Morphism Equivalence Problem, Theoretical Computer Science