Normal Form on Linear Tree-to-Word Transducers

DOI10.1007/978-3-319-30000-9_34zbMath1443.68084OpenAlexW2406974219MaRDI QIDQ2798740

Adrien Boiret

Publication date: 13 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01218030/file/0.pdf

zbMATH Keywords

normal formtransducerstree-to-word transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Equivalence of Linear Tree Transducers with Output in the Free Group ⋮ Unnamed Item ⋮ Streaming ranked-tree-to-string transducers ⋮ Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time

This page was built for publication: Normal Form on Linear Tree-to-Word Transducers