Equivalence of Deterministic Nested Word to Word Transducers [chapter]

Sławomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren
2009 Lecture Notes in Computer Science  
We study the equivalence problem of deterministic nested word to word transducers and show it to be surprisingly robust. Modulo polynomial 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.
doi:10.1007/978-3-642-03409-1_28 fatcat:4censhk3azdqppd2uhglqteoqe