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

@@ Property / cites work @@
+State-strategies for games in <i>F<sub>σδ</sub></i> ∩ <i>G<sub>δσ</sub></i>
+Normal rank
@@ Property / cites work @@
+Solving Sequential Conditions by Finite-State Strategies
+Normal rank
@@ Property / cites work @@
+Q3336675
@@ Property / cites work: Q3336675 / rank @@
+Normal rank
@@ Property / cites work @@
+Decision procedures and expressiveness in the temporal logic of branching time
+Normal rank
@@ Property / cites work @@
+The Complexity of Tree Automata and Logics of Programs
+Normal rank
@@ Property / cites work @@
+Deciding full branching time logic
@@ Property / cites work: Deciding full branching time logic / rank @@
+Normal rank
@@ Property / cites work @@
+Progress measures, immediate determinacy, and a subset construction for tree automata
+Normal rank
@@ Property / cites work @@
+Borel determinacy
@@ Property / cites work: Borel determinacy / rank @@
+Normal rank
@@ Property / cites work @@
+Testing and generating infinite sequences by a finite automaton
+Normal rank
@@ Property / cites work @@
+Q3753490
@@ Property / cites work: Q3753490 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating automata on infinite trees
@@ Property / cites work: Alternating automata on infinite trees / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of Second-Order Theories and Automata on Infinite Trees
+Normal rank