 |
|
|
|
| HAL: inria-00423961, version 1 |
| DOI: 10.1007/978-3-642-03409-1_28 |
| See detailed view |  BibTeX,EndNote,... |
|
|
| Fundamentals of Computation Theory, Wroclaw : Poland (2009) |
|
|
|
|
| Equivalence of Deterministic Nested Word to Word Transducers |
|
|
| Slawomir Staworko 1Grégoire Laurence 2 |
|
|
| (2009-09-19) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | MOSTRARE (INRIA Lille - Nord Europe) |
|
|
|
INRIA – CNRS : UMR8022 – Université des Sciences et Technologies de Lille - Lille I : EA3588 – Université Charles de Gaulle - Lille III |
|
|
| 2: | Laboratoire d'Informatique Fondamentale de Lille (LIFL) |
|
|
|
CNRS : UMR8022 – INRIA – IRCICA – Université des Sciences et Technologies de Lille - Lille I |
|
|
| 3: | GRAPPA (LIFL) |
|
|
|
CNRS : UMR8022 – Université Charles de Gaulle - Lille III – Université des Sciences et Technologies de Lille - Lille I |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Computational Complexity Computer Science/Computation and Language Computer Science/Databases |
|
|
| trees – transducers – automata – context-free grammars – XML |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| inria-00423961, version 1 | |
| http://hal.inria.fr/inria-00423961 | |
| oai:hal.inria.fr:inria-00423961 | |
| From: Grégoire Laurence | |
| Submitted on: Tuesday, 13 October 2009 14:53:24 | |
| Updated on: Monday, 1 August 2011 15:03:25 | |
