When is a functional tree transduction deterministic?

DOI10.1007/3-540-56610-4_69zbMATH Open1497.68280OpenAlexW1493501031MaRDI QIDQ5044741FDOQ5044741

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Determinization of transducers over infinite words: The general case
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• Minimization of deterministic bottom-up tree transducers
• A canonical semi-deterministic transducer
• 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)