Determinization and memoryless winning strategies (Q1357005): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1006/inco.1997.2624 / rank
Normal rank
 
Property / cites work
 
Property / cites work: State-strategies for games in <i>F<sub>σδ</sub></i> ∩ <i>G<sub>δσ</sub></i> / 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: Q3336675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision procedures and expressiveness in the temporal logic of branching time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Tree Automata and Logics of Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding full branching time logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress measures, immediate determinacy, and a subset construction for tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel determinacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing and generating infinite sequences by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3753490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/INCO.1997.2624 / rank
 
Normal rank

Latest revision as of 18:40, 10 December 2024

scientific article
Language Label Description Also known as
English
Determinization and memoryless winning strategies
scientific article

    Statements

    Identifiers