Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Emmanuel Filiot Connect in order to contact the contributor
Submitted on : Saturday, June 19, 2010 - 6:28:24 PM
Last modification on : Thursday, October 21, 2021 - 3:59:48 AM
Long-term archiving on: : Tuesday, September 21, 2010 - 11:02:40 AM


Files produced by the author(s)


  • HAL Id : inria-00492241, version 2



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. ⟨inria-00492241v2⟩



Record views


Files downloads