On the Balancedness of Tree-to-Word Transducers

DOI10.1142/S0129054121420077MaRDI QIDQ6169900zbMATH OpenOpenAlexFDO

Authors Raphaela Löbel, Michael Luttenberger, 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

zbMATH Keywords

equivalencebalancednesslongest common suffix/prefix

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the balancedness of tree-to-word transducers
• Balancedness of MSO transductions in polynomial time
• Deciding equivalence of linear tree-to-word transducers in polynomial time
• Decidability of equivalence for a class of non-deterministic tree transducers
• scientific article; zbMATH DE number 148020

Cites work

• scientific article; zbMATH DE number 7228439 (Why is no real title available?)
• scientific article; zbMATH DE number 5643878 (Why is no real title available?)
• A characterization of parenthesis languages
• Algorithmics on SLP-compressed strings: a survey
• Balancedness of MSO transductions in polynomial time
• Complexity Results on Balanced Context-Free Languages
• Derivation tree analysis for accelerated fixed-point computation
• Equivalence of Linear Tree Transducers with Output in the Free Group
• Equivalence of deterministic top-down tree-to-string transducers is decidable
• Formal properties of XML grammars and languages
• On the Balancedness of Tree-to-Word Transducers
• Visibly pushdown transducers with well-nested outputs
• XML Validation for Context-Free Grammars

Cited in

(2)

• On the balancedness of tree-to-word transducers
• On the Balancedness of Tree-to-Word Transducers

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

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