On the Balancedness of Tree-to-Word Transducers

DOI10.1142/S0129054121420077zbMATH Open1518.68184OpenAlexW3183346074MaRDI QIDQ6169900FDOQ6169900

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

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

zbMATH Keywords

equivalencebalancednesslongest common suffix/prefix

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

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

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)