Visibly Pushdown Transducers with Well-Nested Outputs

DOI10.1142/S0129054116400086zbMath1338.68158MaRDI QIDQ5890815

Jean-Marc Talbot, Pierre-Alain Reynier

Publication date: 23 June 2016

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

zbMATH Keywords

automatatree transformationstransducersnested words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

On the Balancedness of Tree-to-Word Transducers ⋮ On the Balancedness of Tree-to-Word Transducers

Cites Work

• THE INCLUSION PROBLEM OF CONTEXT-FREE LANGUAGES: SOME TRACTABLE CASES
• Adding nesting structure to words

This page was built for publication: Visibly Pushdown Transducers with Well-Nested Outputs