Solving sequential conditions by finite-state strategies
Summary (1 min read)
Xt
- The authors have not investigated the following question.
- Modify the recursions (13) to a schema with parameters which, by proper additional specifications for the parameters, will yield any given deterministic operator which solves C(XiY) for Y, also known as Problem.
Did you find this useful? Give us your feedback
Citations
1,612 citations
1,475 citations
1,449 citations
Cites background from "Solving sequential conditions by fi..."
...This is the property of determinedness for turn-based games [B¨uchi and Landweber 1969; Gurevich and Harrington 1982]; in each state, either the players in A can win with objective A, or the players not in A can win with the complementary objective....
[...]
1,108 citations
814 citations
References
1,930 citations
1,799 citations
1,132 citations
"Solving sequential conditions by fi..." refers methods in this paper
...A. Church, Application of recursive arithmetic to the problem of circuit synthesis, Summaries of Talks Presented at the Summer Institute for Symbolic Logic, Cornell Univ. 1957, 2nd ed; Princeton, N. J., 1960, 3-50....
[...]
553 citations
519 citations
"Solving sequential conditions by fi..." refers background in this paper
...Such algorithms are discussed in the literature [2], [5], [6], [8], [9], [18] and [19]....
[...]