Properties of Visibly Pushdown Transducers

Abstract : Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automata, the input symbols determine the stack operations. It has been shown that visibly pushdown languages form a robust subclass of context-free languages. Along the same line, we show that word transductions defined by VPTs enjoy strong properties, in contrast to PTs. In particular, functionality is decidable in PTime, k-valuedness is in NPTime and equivalence of (non-deterministic) functional VPTs is ExpTime-C. Those problems are undecidable for PTs. Output words of VPTs are not necessarily well-nested. We identify a general subclass of VPTs that produce well-nested words, which is closed by composition, and for which the type checking problem is decidable.
Type de document :
Communication dans un congrès
35th International Symposium on Mathematical Foundations of Computer Science, Aug 2010, Brno, Czech Republic. 2010
Liste complète des métadonnées


https://hal.inria.fr/inria-00492241
Contributeur : Emmanuel Filiot <>
Soumis le : samedi 19 juin 2010 - 18:28:24
Dernière modification le : mardi 14 février 2017 - 10:03:41
Document(s) archivé(s) le : mardi 21 septembre 2010 - 11:02:40

Fichier

vpts-mfcs.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00492241, version 2

Collections

Citation

Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot. Properties of Visibly Pushdown Transducers. 35th International Symposium on Mathematical Foundations of Computer Science, Aug 2010, Brno, Czech Republic. 2010. <inria-00492241v2>

Partager

Métriques

Consultations de
la notice

256

Téléchargements du document

117