J.R. Büchi, On a decision method in the restricted second-order arithmetic. In Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley 1960. Stanford University Press (1962) 1–11.
K.J. Compton, On rich words. In M. Lothaire, editor, Combinatorics on words. Progress and perspectives, Proc. Int. Meet., Waterloo, Canada (1982). Encyclopedia of Mathematics
17, Addison-Wesley (1983) 39–61.
C.C. Elgot and M.O. Rabin. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor. J. Symbolic Logic
31 (1966) 169–181.
Feferman, S. and Vaught, R.L., The first order properties of products of algebraic systems.
47 (1959) 57–103.
D. Perrin and J.-É. Pin, Infinite Words. Pure Appl. Math.
Harizanov, V.S., Computably-theoretic complexity of countable structures.
Bull. Symbolic Logic
8 (2002) 457–477.
Shelah, S., The monadic theory of order.
102 (1975) 379–419.
Soprunov, S., Decidable expansions of structures.
134 (1988) 175–179 (in Russian).
Thomas, W., The theory of successor with an extra predicate.
237 (1978) 121–132.
Thomas, W., Ehrenfeucht games, the composition method, and the monadic theory of ordinal words. In Structures in Logic and Computer Science, A Selection of Essays in Honor of A. Ehrenfeucht.
Lect. Notes Comput. Sci.
1261 (1997) 118–143.