Synthesis of deterministic top-down tree transducers from automatic tree relations

DOI10.1016/j.ic.2016.07.013zbMath1369.68254arXiv1408.5959OpenAlexW2071447691MaRDI QIDQ515670

Sarah Winter, Christof Löding

Publication date: 16 March 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.5959

zbMATH Keywords

uniformizationdecidabilitytree automatontree transducerautomatic relation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

How Much Lookahead is Needed to Win Infinite Games? ⋮ How Much Lookahead is Needed to Win Infinite Games?

Cites Work

• On tree transducers for partial functions
• Typechecking for XML transformers
• Automata, logics, and infinite games. A guide to current research
• Degrees of Lookahead in Regular Infinite Games
• Solving Sequential Conditions by Finite-State Strategies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synthesis of deterministic top-down tree transducers from automatic tree relations