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

Adrien Boiret 1, 2, 3 Raphaela Palenta 4
1 LINKS - Linking Dynamic Data
CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189, Inria Lille - Nord Europe
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.
Type de document :
Communication dans un congrès
20th International Conference on Developments in Language Theory (DLT 2016), Jul 2016, Montreal, Canada. Springer, Lecture Notes in Computer Science, 9840 pp.355-367, 2016, Developments in Language Theory - 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings. 〈10.1007/978-3-662-53132-7_29〉
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01429110
Contributeur : Inria Links <>
Soumis le : lundi 30 janvier 2017 - 13:46:09
Dernière modification le : mardi 3 juillet 2018 - 11:21:06

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

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. Springer, Lecture Notes in Computer Science, 9840 pp.355-367, 2016, Developments in Language Theory - 20th International Conference, DLT 2016, Montréal, Canada, July 25-28, 2016, Proceedings. 〈10.1007/978-3-662-53132-7_29〉. 〈hal-01429110〉

Partager

Métriques

Consultations de la notice

207

Téléchargements de fichiers

208