Expressiveness of visibly pushdown transducers

MaRDI QIDQ4994131zbMATH OpenFDO

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

Publication date 17 June 2021

Full work available at URL https://arxiv.org/abs/1311.5571, http://eptcs.web.cse.unsw.edu.au/paper.cgi?TTATT2013.3

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Visibly pushdown transducers with well-nested outputs
• Visibly pushdown transducers with well-nested outputs
• Visibly pushdown transducers
• Properties of visibly pushdown transducers
• Visibly pushdown transducers with look-ahead

Cited in

(9)

• Visibly pushdown transducers
• Visibly pushdown transducers with look-ahead
• Streamability of nested word transductions
• On the Expressive Power of 2-Stack Visibly Pushdown Automata
• Two-way visibly pushdown automata and transducers
• Streamability of nested word transductions
• Visibly pushdown transducers with well-nested outputs
• Visibly pushdown transducers with well-nested outputs
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Expressiveness of visibly pushdown transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4994131)