Determinization and memoryless winning strategies

DOI10.1006/inco.1997.2624zbMath0887.68071OpenAlexW1968847402MaRDI QIDQ1357005

Charanjit 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)

Related Items (1)

Monoidal-closed categories of tree automata

Cites Work

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

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