Expressiveness of Visibly Pushdown Transducers
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2013
- DOI:
- 10.48550/arXiv.1311.5571
- arXiv:
- arXiv:1311.5571
- Bibcode:
- 2013arXiv1311.5571C
- Keywords:
-
- Computer Science - Formal Languages and Automata Theory;
- F.1.1;
- F.4.3
- E-Print:
- In Proceedings TTATT 2013, arXiv:1311.5058