Normalization of Sequential Top-Down Tree-to-Word Transducers

Abstract : We study normalization of deterministic sequential top-down tree-to-word transducers (STWs), that capture the class of deterministic top-down nested-word to word transducers. We identify the subclass of earliest STWs (eSTWs) that yield normal forms when minimized. The main result of this paper is an effective normalization procedure for STWs. It consists of two stages: we first convert a given STW to an equivalent eSTW, and then, we minimize the eSTW.

Keywords: formal language theory, tree automata, transformations, XML databases, XSLT

Extended Version:

A long version is available here.

Type de document :
Communication dans un congrès
5th International Conference on Language Automata Theory and Appliciations, May 2011, Tarragona, Spain. Springer, 2011, LNCS
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00566291
Contributeur : Joachim Niehren <>
Soumis le : mardi 1 mars 2011 - 12:37:40
Dernière modification le : jeudi 11 janvier 2018 - 06:22:13
Document(s) archivé(s) le : lundi 30 mai 2011 - 02:16:45

Fichier

lata-final.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00566291, version 1

Collections

Citation

Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawomir Staworko, Marc Tommasi. Normalization of Sequential Top-Down Tree-to-Word Transducers. 5th International Conference on Language Automata Theory and Appliciations, May 2011, Tarragona, Spain. Springer, 2011, LNCS. 〈inria-00566291〉

Partager

Métriques

Consultations de la notice

427

Téléchargements de fichiers

218