Pages that link to "Item:Q3557856"
From MaRDI portal
The following pages link to Degrees of Lookahead in Regular Infinite Games (Q3557856):
Displayed 9 items.
- Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670) (← links)
- Synthesizing structured reactive programs via deterministic tree automata (Q2346409) (← links)
- The per-character cost of repairing word languages (Q2453121) (← links)
- Delay Games with WMSO+U Winning Conditions (Q2953690) (← links)
- (Q5002830) (← links)
- (Q5005148) (← links)
- Infinite-Duration Bidding Games (Q5111634) (← links)
- How Much Lookahead is Needed to Win Infinite Games? (Q5892380) (← links)
- Synthesizing Computable Functions from Rational Specifications Over Infinite Words (Q6195088) (← links)