Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies (Q752703)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4179362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies |
scientific article; zbMATH DE number 4179362 |
Statements
Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies (English)
0 references
1990
0 references
infinite games with perfect information
0 references
tree
0 references
automata
0 references
priority automata
0 references
deterministic strategy
0 references
nondeterministic strategy
0 references
Gurevich- Harrington's Restricted Memory Determinacy Theorem
0 references
Determinacy with Restraints Problem
0 references
strategies with restricted memory
0 references
concurrent programs
0 references
modularity of a winning strategy
0 references
program specification
0 references
0.7889506816864014
0 references
0.7769333720207214
0 references
0.775482714176178
0 references
