Determinization and memoryless winning strategies (Q1357005)

From MaRDI portal

Revision as of 15:53, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Determinization and memoryless winning strategies (English)

0 references

Charanjit S. Jutla

0 references

Information and Computation

0 references

publication date

16 June 1997

0 references

zbMATH Keywords

\(\omega\)-automata

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1006/inco.1997.2624

0 references

State-strategies for games in <i>F<sub>σδ</sub></i> ∩ <i>G<sub>δσ</sub></i>

0 references

Solving Sequential Conditions by Finite-State Strategies

0 references

0 references

Decision procedures and expressiveness in the temporal logic of branching time

0 references

The Complexity of Tree Automata and Logics of Programs

0 references

Deciding full branching time logic

0 references

Progress measures, immediate determinacy, and a subset construction for tree automata

0 references

Borel determinacy

0 references

Testing and generating infinite sequences by a finite automaton

0 references

0 references

Alternating automata on infinite trees

0 references

Decidability of Second-Order Theories and Automata on Infinite Trees

0 references

Identifiers

zbMATH Open document ID

0 references

10.1006/inco.1997.2624

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1357005

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1357005&oldid=34182446"