The Monadic Theory of Morphic Infinite Words and Generalizations
We present new examples of infinite words which have a decidable monadic theory. Formally, we consider structures 〈ℕ,<P〉 which expand the ordering 〈ℕ,<〉 of the natural numbers by a unary predicate P; the corresponding infinite word is the characteristic 0-1-sequence xP of P. We show that for a morphic predicate P the associated monadic second-order theory MThhℕ,<P〉 is decidable, thus extending results of Elgot and Rabin (1966) and Maes (1999). The solution is obtained in the framework of semigroup theory, which is then connected to the known automata theoretic approach of Elgot and Rabin. Finally, a large class of predicates P is exhibited such that the monadic theory MTh〈ℕ〈, P〉 is decidable, which unifies and extends the previously known examples.
KeywordsDecision Problem Fibonacci Number Characteristic Word Unary Predicate Contraction Method
Unable to display preview. Download preview PDF.
- Jorge Almeida. Finite Semigroups and Universal Algebra. World Scientific, 1994.Google Scholar
- Frédérique Bassino, Marie-Pierre Béal, and Dominique Perrin. Length distributions and regular sequences. Technical report, IGM, 2000.Google Scholar
- Jean Berstel. Axel Thue’s work on repetitions in words. In P. Leroux and C. Reutenauer, editors, Séries formelles et combinatoire algébrique, pages 65–80. Publications du LaCIM, Université du Québec á Montréal, 1990.Google Scholar
- Jean Berstel and Patrice Séébold. Algebraic Combinatorics on Words, chapter 2, pages 40–96. Cambridge University Press, 2000.Google Scholar
- J. Richard Büchi. On a decision method in the restricted second-order arithmetic. In Proc. Int. Congress Logic, Methodology and Philosophy of science, Berkeley 1960, pages 1–14. Stanford University Press, 1962.Google Scholar
- F. A. Hosch. Decision Problems in Büchi’s Sequential Calculus. Dissertation, University of New Orleans, Louisiana, 1971.Google Scholar
- C. Michaux and R. Villemaire. Open questions around Büchi and presburger arithmetics. In Wilfrid Hodges et al., editors, Logic: from foundations to applications. European logic colloquium, pages 353–383, Oxford, 1996. Clarendon Press.Google Scholar
- Arto Salomaa and Matti Soittola. Automata-Theoric Aspects of Formal Power Series. Springer-Verlag, New York, 1978.Google Scholar
- D. Siefkes. Decidable extensions of monadic second order successor arithmetic. In J. Doerr and G. Hotz, editors, Automatentheorie und Formale Sprachen, pages 441–472, Mannheim, 1970. B.I. Hochschultaschenbücher.Google Scholar
- Wolfgang Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4, pages 133–191. Elsevier, 1990.Google Scholar