Normalization of Sequential Top-Down Tree-to-Word Transducers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

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

Résumé

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.

Fichier principal
Vignette du fichier
lata-final.pdf (393.27 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00566291 , version 1 (01-03-2011)

Identifiants

  • HAL Id : inria-00566291 , version 1

Citer

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. ⟨inria-00566291⟩
196 Consultations
185 Téléchargements

Partager

Gmail Facebook X LinkedIn More