Visibly pushdown transducers

Abstract : Visibly pushdown transducers (VPT) extend visibly pushdown automata (VPA) with outputs. They read nested words, i.e. finite words on a structured alphabet partitioned into call, return and internal symbols, and produce output words, which are not necessarily nested. As for VPA, the behavior of the stack is synchronized with the types of input symbols: on reading a call symbol, exactly one stack symbol is pushed onto the stack; on reading a return symbol, exactly one stack symbol is popped from the stack; and the stack is untouched when reading internal symbols. Along their transitions VPT can append words on their output tape, whose concatenation define the resulting output word. Therefore VPT define transformations from nested words to words and can be seen as a subclass of pushdown transducers. In this paper, we study the algorithmic, closure and expressiveness properties of VPT.
Document type :
Journal articles
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02093318
Contributor : Pierre-Alain Reynier <>
Submitted on : Monday, April 8, 2019 - 6:29:14 PM
Last modification on : Tuesday, April 9, 2019 - 1:22:58 AM

File

jcss18.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot. Visibly pushdown transducers. Journal of Computer and System Sciences, Elsevier, 2018, 97, pp.147-181. ⟨10.1016/j.jcss.2018.05.002⟩. ⟨hal-02093318⟩

Share

Metrics

Record views

110

Files downloads

66