Pages that link to "Item:Q515670"
From MaRDI portal
The following pages link to Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670):
Displaying 7 items.
- Deterministic bottom-up tree transducers and ground term rewrite systems (Q1019744) (← links)
- Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers (Q4608628) (← links)
- Superlinear deterministic top-down tree transducers (Q4895817) (← links)
- Logics for Word Transductions with Synthesis (Q5145302) (← links)
- How Much Lookahead is Needed to Win Infinite Games? (Q5892380) (← links)
- How Much Lookahead is Needed to Win Infinite Games? (Q5899477) (← links)
- Definability Results for Top-Down Tree Transducers (Q6169966) (← links)