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 ?N, <, P? which expand the ordering ?N, <? 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 MTh?N, <, 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?N, <, P? is decidable, which unifies and extends the previously known examples.

[1]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.

[2]  Arto Salomaa,et al.  Automata-Theoretic Aspects of Formal Power Series , 1978, Texts and Monographs in Computer Science.

[3]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[4]  Olivier Carton,et al.  The Monadic Theory of Morphic Infinite Words and Generalizations , 2000, Inf. Comput..

[5]  J.-P. Allouche,et al.  Linear Cellular Automata, Finite Automata and Pascal's Triangle , 1996, Discret. Appl. Math..

[6]  Jean Berstel,et al.  Axel Thue's work on repetitions in words , 1992 .

[7]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[8]  Arnaud Maes.  An Automata Theoretic Decidability Proof for First-Order Theory of ⟨ℕ,<,P⟩ with Morphic Predicate P , 1999, J. Autom. Lang. Comb..

[9]  Lawrence H. Landweber,et al.  Definability in the monadic second-order theory of successor , 1969, Journal of Symbolic Logic.

[10]  D. Siefkes.  Undecidable Extensions of Monadic Second Order Successor Arithmetic , 1971 .

[11]  Calvin C. Elgot,et al.  Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor , 1966, J. Symb. Log..

[12]  Grzegorz Rozenberg,et al.  Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht , 1997 .

[13]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[14]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .

[15]  Jorge Almeida,et al.  Finite Semigroups and Universal Algebra , 1995 .

[16]  Carl G. Jockusch,et al.  Decidability and Undecidability of Theories with a Predicate for the Primes , 1993, J. Symb. Log..

[17]  W. Thomas.  The theory of successor with an extra predicate , 1978 .

[18]  Wolfgang Thomas,et al.  Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words , 1997, Structures in Logic and Computer Science.

[19]  M. Lothaire.  Algebraic Combinatorics on Words , 2002 .

[20]  Dominique Perrin,et al.  Length Distributions and Regular Sequences , 2001 .

[21]  Wolfgang Thomas.  On the Bounded Monadic Theory of Well-Ordered Structures , 1980, J. Symb. Log..

[22]  D. Siefkes.  Büchi's monadic second order successor arithmetic , 1970 .

[23]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science (2. ed.) , 1994 .

[24]  Roger Villemaire,et al.  Open questions around Bu¨chi and Presburger arithmetics , 1996 .

[25]  Frederick Anthony Hosch,et al.  Decision problems in buechi's sequential calculus , 1972 .