On the Balancedness of Tree-to-Word Transducers

DOI10.1007/978-3-030-48516-0_17OpenAlexW3032555833MaRDI QIDQ5041263

Michael Luttenberger, Raphaela Löbel, Helmut Seidl

Publication date: 13 October 2022

Published in: Developments in Language Theory (Search for Journal in Brave)

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

zbMATH Keywords

equivalencebalancedness of tree-to-word transducerlongest common suffix/prefix of a CFG

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Derivation tree analysis for accelerated fixed-point computation
• Formal properties of XML grammars and languages
• Balancedness of MSO transductions in polynomial time
• Algorithmics on SLP-compressed strings: A survey
• Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable
• XML Validation for Context-Free Grammars
• A characterization of parenthesis languages
• Complexity Results on Balanced Context-Free Languages
• Visibly Pushdown Transducers with Well-Nested Outputs

This page was built for publication: On the Balancedness of Tree-to-Word Transducers