Equivalence of Linear Tree Transducers with Output in the Free Group

DOI10.1007/978-3-030-48516-0_16OpenAlexW3030420653MaRDI QIDQ5041262

Michael Luttenberger, Helmut Seidl, Raphaela Löbel

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/2001.03480

zbMATH Keywords

free grouppolynomial timeequivalence problemlinear tree transducer

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On the Balancedness of Tree-to-Word Transducers

Cites Work

• A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict
• Combinatorial group theory.
• Normal Form on Linear Tree-to-Word Transducers
• Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time
• Normalization of Sequential Top-Down Tree-to-Word Transducers
• Equivalence of Deterministic Nested Word to Word Transducers
• Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable
• Learning Sequential Tree-to-Word Transducers
• The Compressed Word Problem for Groups
• Automata, Languages and Programming

This page was built for publication: Equivalence of Linear Tree Transducers with Output in the Free Group