The Collected Works of J. Richard BĂĽchi pp 525-541 | Cite as

# Solving Sequential Conditions by Finite-State Strategies

## Abstract

Our main purpose is to present an algorithm which decides whether or not a condition đť•®(*X, Y*) stated in sequential calculus admits a finite automata solution, and produces one if it exists. This solves a problem stated in [4] and contains, as a very special case, the answer to Case 4 left open in [6]. In an equally appealing form the result can be restated in the terminology of [7], [10], [15]: Every *Ď‰*-game definable in sequential calculus is determined. Moreover the player who has a winning strategy, in fact, has a winning finite-state strategy, that is one which can effectively be played in a strong sense. The main proof, that of the central Theorem 1, will be presented at the end. We begin with a discussion of its consequences.

## Keywords

Sequential ConditionÂ Finite AutomatonÂ Winning StrategyÂ Sequential CalculusÂ Recursive OperatorÂ## Preview

Unable to display preview. Download preview PDF.

## Bibliography

- 1.J. R. Buchi,
*Decision methods in the theory of ordinals*, Bull. Amer. Math. Soc. 71 (1965), 767â€“770.MathSciNetCrossRefGoogle Scholar - 2.J. R. Buchi, C. E. Elgot and J. B. Wright,
*The nonexistence of certain algorithms of finite automata theory*, Notices Amer. Math. Soc.**5**(1958), 98.Google Scholar - 3.J. R. Buchi,
*Weak second-order arithmetic and finite automata, Z.*Math. Logik Grundlagen Math.**6**(1960), 66â€“92.MathSciNetCrossRefGoogle Scholar - 4.J. R. Buchi,
*On a decision method in restricted second order arithmetic*, Proc. Internat. Congr. Logic, Method, and Philos. Sci. 1960, Stanford Univ. Press, Stanford, Calif., 1962.Google Scholar - 5.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.Google Scholar - 6.A. Church,
*Logic arithmetic and automata*, Proc. Internat. Congr. Math. 1963, Almqvist and Wiksells, Uppsala, 1963.Google Scholar - 7.M. Davis, â€śInfinite games of perfect informationâ€ť in
*Advances in game theory*, Princeton Univ. Press, Princeton, N. J., 1964, 85â€“101.Google Scholar - 8.C. C. Elgot,
*Decision problems of finite automata design and related arithmetics*, Trans. Amer. Math. Soc.**98**(1961), 21â€“51.MathSciNetCrossRefGoogle Scholar - 9.J. Friedman,
*Some results in Churchâ€™s restricted recursive arithmetic*, J. Symbolic Logic**22**(1957), 337â€“342.CrossRefGoogle Scholar - 10.D. Gale and F. M. Stewart, â€śInfinite games with perfect informationâ€ť in
*Contributions to the theory of games*, Vol. II, Princeton Univ. Press, Princeton, N. J., 1953, 245â€“266.Google Scholar - 11.S. C. Kleene,
*Arithmetical predicates and function quantifiers*, Trans. Amer. Math. Soc.**79**(1955), 312â€“340.MathSciNetzbMATHCrossRefGoogle Scholar - 12.S. C. Kleene, â€śRepresentation of events in nerve nets and finite automataâ€ť in
*Automata studies*, Princeton Univ. Press. Princeton, N. J., 1956, 3â€“41.Google Scholar - 13.L. H. Landweber,
*Finite state games*â€”*A solvability algorithm for restricted second-order arithmetic*, Notices Amer. Math. Soc.**14**(1967), 129â€“130.Google Scholar - 14.R. McNaughton,
*Testing and generating infinite sequences by a finite automaton*, Information and Control**9**(1966), 521â€“530.MathSciNetzbMATHCrossRefGoogle Scholar - 15.J. Mycielski, S. Swierczkowski and A. Zieba,
*On infinite positional games*, Bull. Acad. Polon. Sci. Cl. III**4**(1956), 485â€“488.MathSciNetzbMATHGoogle Scholar - 16.M. Rabin and D. Scott,
*Finite automata and their decision problems*, IBM J. Res. Develop. 3(1959), 114â€“125.MathSciNetGoogle Scholar - 17.M. Rabin, â€śEffective computability of winning strategiesâ€ť in
*Contributions to the theory of games*, Vol. III, Princeton Univ. Press, Princeton, N. J., 1957, 147â€“157.Google Scholar - 18.B. A. Trachtenbrot,
*Synthesis of logic networks whose operators are described by means of single place predicate calculus*, Dokl. Akad. Nauk SSSR**118**(1958), 646â€“649.MathSciNetGoogle Scholar - 19.B. A. Trachtenbrot,
*Finite automata and the logic of single place predicates*, Dokl. Akad. Nauk SSSR**140**(1961), 320â€“323 = Soviet Math. Dokl. 2 (1961), 623â€“626.Google Scholar - 20.J. R. Buchi and L. G. Landweber,
*Definability in the monadic second-order theory of successor*, J. Symbolic Logic**34**(1969).Google Scholar