Visibly Pushdown Transducers with Well-nested Outputs

Pierre-Alain Reynier (1) , Jean-Marc Talbot (1)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille

Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced to model transformations of nested words, i.e. words with a call/return structure. When outputs are also structured and well nested words, VPTs are a natural formalism to express tree transformations evaluated in streaming. We prove the class of VPTs with well-nested outputs to be decidable in PTIME. Moreover, we show that this class is closed under composition and that its type-checking against visibly pushdown languages is decidable.

Mots clés: Transduction; Visibly Pushdown Transducers; Nested words

Domaines: Théorie et langage formel [cs.FL]

Pierre-Alain Reynier, Jean-Marc Talbot. Visibly Pushdown Transducers with Well-nested Outputs. 2014. ⟨hal-00988129⟩