Equivalence of Deterministic Nested Word to Word Transducers - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Equivalence of Deterministic Nested Word to Word Transducers

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.
Fichier principal
Vignette du fichier
0.pdf (178.61 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00423961 , version 1 (13-10-2009)

Identifiers

Cite

Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren. Equivalence of Deterministic Nested Word to Word Transducers. Fundamentals of Computation Theory, Maciej Gebala and Malgorzata Korzeniowska, Sep 2009, Wroclaw, Poland. pp.310-322, ⟨10.1007/978-3-642-03409-1_28⟩. ⟨inria-00423961⟩
292 View
212 Download

Altmetric

Share

Gmail Facebook X LinkedIn More