Expressiveness of Visibly Pushdown Transducers
Formal Languages and Automata Theory
2013-11-25 v1
Abstract
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. As trees and more generally hedges can be linearized into (well) nested words, VPTs are a natural formalism to express tree transformations evaluated in streaming. This paper aims at characterizing precisely the expressive power of VPTs with respect to other tree transducer models.
Keywords
Cite
@article{arxiv.1311.5571,
title = {Expressiveness of Visibly Pushdown Transducers},
author = {Mathieu Caralp and Emmanuel Filiot and Pierre-Alain Reynier and Frédéric Servais and Jean-Marc Talbot},
journal= {arXiv preprint arXiv:1311.5571},
year = {2013}
}
Comments
In Proceedings TTATT 2013, arXiv:1311.5058