Uniformization problems for tree-automatic relations and top-down tree transducers

DOI10.4230/LIPICS.MFCS.2016.65zbMATH Open1398.68320OpenAlexW2540285709MaRDI QIDQ4608628FDOQ4608628

Authors: Christof Löding, Sarah Winter 

Publication date: 21 March 2018

Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2016/6477/pdf/LIPIcs-MFCS-2016-65.pdf/

Recommendations

• Synthesis of deterministic top-down tree transducers from automatic tree relations
• scientific article; zbMATH DE number 7376069
• On equivalence and uniformisation problems for finite transducers
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• scientific article; zbMATH DE number 6741931

zbMATH Keywords

uniformizationtree transducerstree-automatic relation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Decidability of theories and sets of sentences (03B25)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• A uniformization theorem for nested word to word transductions
• Solving a unification problem under constrained substitutions using tree automata
• Title not available (Why is that?)
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• Synthesis of deterministic top-down tree transducers from automatic tree relations

This page was built for publication: Uniformization problems for tree-automatic relations and top-down tree transducers

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