Linear high-order deterministic tree transducers with regular look-ahead - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

Linear high-order deterministic tree transducers with regular look-ahead

Paul D Gallot
  • Function : Author
  • PersonId : 997903
Aurélien Lemay
  • Function : Author
  • PersonId : 834816
Sylvain Salvati


We introduce the notion of high-order deterministic top-down tree transducers (HODT) whose outputs correspond to simply-typed lambda-calculus formulas. These transducers are natural generalizations of known models of top-tree transducers such as: Deterministic Top-Down Tree Transducers, Macro Tree Transducers, Streaming Tree Transducers... We focus on the linear restriction of high order tree transducers with look-ahead (HODTR lin), and prove this corresponds to tree to tree functional transformations defined by Monadic Second Order (MSO) logic. We give a specialized procedure for the composition of those transducers that uses a flow analysis based on coherence spaces and allows us to preserve the linearity of transducers. This procedure has a better complexity than classical algorithms for composition of other equivalent tree transducers, but raises the order of transducers. However, we also indicate that the order of a HODTR lin can always be bounded by 3, and give a procedure that reduces the order of a HODTR lin to 3. As those resulting HODTR lin can then be transformed into other equivalent models, this gives an important insight on composition algorithm for other classes of transducers. Finally, we prove that those results partially translate to the case of almost linear HODTR: the class corresponds to the class of tree transformations performed by MSO with unfolding (not closed by composition), and provide a mechanism to reduce the order to 3 in this case.
Fichier principal
Vignette du fichier
MFCS 2020.pdf (584.64 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-02902853 , version 1 (20-07-2020)
hal-02902853 , version 2 (18-09-2020)



Paul D Gallot, Aurélien Lemay, Sylvain Salvati. Linear high-order deterministic tree transducers with regular look-ahead. MFCS 2020 : The 45th International Symposium on Mathematical Foundations of Computer Science, Andreas Feldmann; Michal Koucky; Anna Kotesovcova, Aug 2020, Prague, Czech Republic. ⟨10.4230/LIPIcs.MFCS.2020.34⟩. ⟨hal-02902853v2⟩
205 View
99 Download



Gmail Facebook X LinkedIn More