Determinization and memoryless winning strategies
type: Item
instance of: scholarly article
title: Determinization and memoryless winning strategies
zbMATH Open document ID: 0887.68071
author: C. S. Jutla
published in: Information and Computation
publication date: 1997-06-16T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1022241
zbMATH Keywords: \(\omega\)-automata
MaRDI profile type: Publication
full work available at URL: inco.1997.2624
OpenAlex ID: W1968847402
cites work: State-strategies for games in Fσδ ∩ Gδσ
cites work: Solving Sequential Conditions by Finite-State Strategies
cites work: Q3336675
cites work: Decision procedures and expressiveness in the temporal logic of branching time
cites work: The Complexity of Tree Automata and Logics of Programs
cites work: Deciding full branching time logic
cites work: Progress measures, immediate determinacy, and a subset construction for tree automata
cites work: Borel determinacy
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Q3753490
cites work: Alternating automata on infinite trees
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
DOI: 10.1006/INCO.1997.2624
description: scientific article; zbMATH DE number 1022241