Properties of Visibly Pushdown Transducers

DOI10.1007/978-3-642-15155-2_32zbMath1287.68095arXiv1002.1443OpenAlexW1599939219MaRDI QIDQ3586097

Frédéric Servais, Jean-Marc Talbot, Pierre-Alain Reynier, Emmanuel Filiot, Jean-François Raskin

Publication date: 3 September 2010

Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.1443

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (6)

Visibly Pushdown Transducers with Look-Ahead ⋮ Colored nested words ⋮ Visibly pushdown transducers ⋮ Efficient determinization of visibly and height-deterministic pushdown automata ⋮ Queries on XML streams with bounded delay and concurrency ⋮ Trimming visibly pushdown automata

This page was built for publication: Properties of Visibly Pushdown Transducers