How Much Lookahead is Needed to Win Infinite Games? (Q5892380): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Sequential Conditions by Finite-State Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: MSO on the Infinite Binary Tree: Choice and Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Lookahead in Context-free Infinite Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rabin's uniformization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Lookahead in Regular Infinite Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Much Lookahead is Needed to Win Infinite Games? / rank
 
Normal rank
Property / cites work
 
Property / cites work: What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead / rank
 
Normal rank
Property / cites work
 
Property / cites work: From liveness to promptness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bounded Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of deterministic top-down tree transducers from automatic tree relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parity Games in Big Steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of Synthesis: Revisiting Church’s Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delay Games with WMSO$$+$$U Winning Conditions / rank
 
Normal rank

Latest revision as of 15:38, 13 July 2024

scientific article; zbMATH DE number 6703910
Language Label Description Also known as
English
How Much Lookahead is Needed to Win Infinite Games?
scientific article; zbMATH DE number 6703910

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references