When is a functional tree transduction deterministic?

DOI10.1007/3-540-56610-4_69MaRDI QIDQ5044741zbMATH OpenOpenAlexFDO

Authors Helmut Seidl

Publication date 2 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56610-4_69

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• How to decide functionality of compositions of top-down tree transducers
• Tree transducers with external functions
• Recursively defined tree transductions
• STACS 2004
• Attributed tree transducers cannot induce all deterministic bottom-up tree transformations
• Determinacy and rewriting of functional top-down and MSO tree transformations
• Equivalence of deterministic top-down tree-to-string transducers is decidable
• Functional and Logic Programming
• scientific article; zbMATH DE number 522869
• A hierarchy of deterministic top-down tree transformations

Cited in

(8)

• Determinization of transducers over infinite words: The general case
• A canonical semi-deterministic transducer
• Minimization of deterministic bottom-up tree transducers
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• scientific article; zbMATH DE number 4043278 (Why is no real title available?)
• scientific article; zbMATH DE number 4108162 (Why is no real title available?)
• Sequentiality of string-to-context transducers
• Synthesis of deterministic top-down tree transducers from automatic tree relations

This page was built for publication: When is a functional tree transduction deterministic?

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