Equivalence of Symbolic Tree Transducers - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Equivalence of Symbolic Tree Transducers

(1, 2) , (1, 2) , (1)
1
2
Vincent Hugot
  • Function : Author
  • PersonId : 958174
Adrien Boiret
  • Function : Author
  • PersonId : 958173
Joachim Niehren

Abstract

Symbolic tree transducers are programs by which to transform data trees with an infinite signature. In this paper, we show that the equivalence problem of symbolic top-down deterministic tree transducers (DTops) can be reduced to that of classical DTops. As a consequence the equivalence of two symbolic DTops can be decided in NExpTime, when assuming that all operations related to the processing of data values are in PTime. This results can be extended to symbolic DTops with lookahead and thus to symbolic bottom-up deterministic tree transducers.
Fichier principal
Vignette du fichier
symbeq.pdf (291.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01517919 , version 1 (09-06-2017)
hal-01517919 , version 2 (30-09-2017)

Identifiers

Cite

Vincent Hugot, Adrien Boiret, Joachim Niehren. Equivalence of Symbolic Tree Transducers. DLT 2017 - Developments in Language Theory, Aug 2017, Liege, Belgium. pp.12, ⟨10.1007/978-3-642-29709-0_32⟩. ⟨hal-01517919v2⟩
453 View
312 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More