Composition closure of -free linear extended top-down tree transducers

DOI10.1007/978-3-642-38771-5_22zbMATH Open1381.68116OpenAlexW2282902173MaRDI QIDQ5300844FDOQ5300844

Authors: Andreas Maletti, Zoltán Fülöp 

Publication date: 28 June 2013

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38771-5_22

Recommendations

• Composition closure of linear extended top-down tree transducers
• Basic tree transducers
• Compositions of extended top-down tree transducers
• Composition closure of linear weighted extended top-down tree transducers
• The Power of Extended Top-Down Tree Transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (4)

• Compositions of extended top-down tree transducers
• Composition closure of linear weighted extended top-down tree transducers
• Linking theorems for tree transducers
• Composition closure of linear extended top-down tree transducers

This page was built for publication: Composition closure of \(\varepsilon \)-free linear extended top-down tree transducers

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