Equivalence of Deterministic Nested Word to Word Transducers

Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.
Original languageEnglish
Title of host publicationFundamentals of Computation Theory
Subtitle of host publication17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings
PublisherSpringer Berlin Heidelberg
Pages310-322
Number of pages13
Volume5699
ISBN (Electronic)978-3-642-03409-1
ISBN (Print)978-3-642-03408-4
DOIs
Publication statusPublished - 2009

Fingerprint

Dive into the research topics of 'Equivalence of Deterministic Nested Word to Word Transducers'. Together they form a unique fingerprint.

Cite this