Visibly Pushdown Transducers

DOI10.1007/978-3-540-70583-3_32MaRDI QIDQ3519516zbMATH OpenOpenAlexFDO

Authors Frédéric Servais, Jean-François Raskin

Publication date 19 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70583-3_32

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

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

Cited in

(17)

• Pseudo-minimal transducer
• Visibly pushdown transducers
• Colored nested words
• Trimming visibly pushdown automata
• Visibly pushdown transducers with look-ahead
• Properties of visibly pushdown transducers
• Synchronization of Pushdown Automata
• Visibly pushdown automata and transducers with counters
• Two-way visibly pushdown automata and transducers
• Invisible pushdown languages
• Visibly pushdown automata: universality and inclusion via antichains
• Trimming visibly pushdown automata
• scientific article; zbMATH DE number 7058469 (Why is no real title available?)
• Queries on XML streams with bounded delay and concurrency
• Visibly pushdown transducers with well-nested outputs
• Visibly pushdown transducers with well-nested outputs
• Evolving schemas for streaming XML

This page was built for publication: Visibly Pushdown Transducers

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