Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

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

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.
Fichier principal
Vignette du fichier
main.pdf (285.56 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01429110 , version 1 (30-01-2017)

Identifiers

Cite

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⟩
166 View
133 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More