Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time

Adrien Boiret 1, 2, 3 Raphaela Palenta 4
1 LINKS - Linking Dynamic Data
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : We show that the equivalence of linear top-down tree-to-word transducers is decidable in polynomial time. Linear tree-to-word transducers are non-copying but not necessarily order-preserving and can be used to express XML and other document transformations. The result is based on a partial normal form that provides a basic characterization of the languages produced by linear tree-to-word transducers.
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01429110
Contributor : Inria Links <>
Submitted on : Monday, January 30, 2017 - 1:46:09 PM
Last modification on : Friday, March 22, 2019 - 1:35:15 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Citation

Adrien Boiret, Raphaela Palenta. Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time. 20th International Conference on Developments in Language Theory (DLT 2016), Jul 2016, Montreal, Canada. pp.355-367, ⟨10.1007/978-3-662-53132-7_29⟩. ⟨hal-01429110⟩

Share

Metrics

Record views

211

Files downloads

221