Work

Expressiveness of Visibly Pushdown Transducers

Year: 2013

Type: article

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.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.134.3

Authors: Mathieu Caralp, Emmanuel Filiot, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot

Institutions: Centre National de la Recherche Scientifique, Aix-Marseille Université, Université Libre de Bruxelles, Hasselt University

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: Agence Nationale de la Recherche, Fonds De La Recherche Scientifique - FNRS, Centre National de la Recherche Scientifique

Award: Etude et Conception de Systèmes avec Perturbations