On the Balancedness of Tree-to-Word Transducers
From MaRDI portal
Publication:6169900
DOI10.1142/s0129054121420077zbMath1518.68184OpenAlexW3183346074MaRDI QIDQ6169900
Michael Luttenberger, Raphaela Löbel, Helmut Seidl
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054121420077
Related Items
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
- Equivalence of Linear Tree Transducers with Output in the Free Group
- 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
- On the Balancedness of Tree-to-Word Transducers
