Determinization and memoryless winning strategies

DOI10.1006/INCO.1997.2624zbMATH Open0887.68071OpenAlexW1968847402MaRDI QIDQ1357005FDOQ1357005

C. S. Jutla

Publication date: 16 June 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1997.2624

zbMATH Keywords

\(\omega\)-automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Borel determinacy
• Decidability of Second-Order Theories and Automata on Infinite Trees
• The Complexity of Tree Automata and Logics of Programs
• Decision procedures and expressiveness in the temporal logic of branching time
• Alternating automata on infinite trees
• Testing and generating infinite sequences by a finite automaton
• Deciding full branching time logic
• State-strategies for games in F_σδ ∩ G_δσ
• Solving Sequential Conditions by Finite-State Strategies
• Progress measures, immediate determinacy, and a subset construction for tree automata

Cited In (6)

• Time-aware uniformization of winning strategies
• Monoidal-closed categories of tree automata
• Title not available (Why is that?)
• Determinancy with Complicated Strategies
• Memoryless determinacy of finite parity games: another simple proof
• Synthesis of finite-state and definable winning strategies

This page was built for publication: Determinization and memoryless winning strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1357005)