The following pages link to (Q5271416):
Displaying 16 items.
- Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670) (← links)
- Uniform inevitability is tree automaton ineffable (Q1108048) (← links)
- Finite-state unification automata and relational languages (Q1341772) (← links)
- Uniformization problem for variants of first order logic over finite words (Q1623002) (← links)
- On computability of data word functions defined by transducers (Q2200823) (← links)
- Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers (Q4608628) (← links)
- (Q5002830) (← links)
- (Q5005148) (← links)
- Uniformity for the decidability of hybrid automata (Q5030200) (← links)
- (Q5092424) (← links)
- (Q5101342) (← links)
- How Much Lookahead is Needed to Win Infinite Games? (Q5892380) (← links)
- How Much Lookahead is Needed to Win Infinite Games? (Q5899477) (← links)
- Synthesizing Computable Functions from Rational Specifications Over Infinite Words (Q6195088) (← links)
- Resynchronized uniformization and definability problems for rational relations (Q6599794) (← links)
- Attributed tree transducers for partial functions (Q6666800) (← links)