Rational series and their languages
Rational series and their languages
Handbook of theoretical computer science (vol. B)
Linear cellular automata, finite automata and Pascal's triangle
Discrete Applied Mathematics
Open questions around Bu¨chi and Presburger arithmetics
Logic: from foundations to applications
An automota theoretic decidability proof for first-order theory of N, with morphic predicate P
Automatica (Journal of IFAC)
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
Automata: Theoretic Aspects of Formal Power Series
Automata: Theoretic Aspects of Formal Power Series
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Decision problems in buechi's sequential calculus
Decision problems in buechi's sequential calculus
Automata logics, and infinite games
Operations preserving regular languages
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
On decidability of monadic logic of order over the naturals extended by monadic predicates
Information and Computation
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
On almost periodicity criteria for morphic sequences in some particular cases
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Parametrized regular infinite games and higher-order pushdown strategies
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Decidable extensions of Church's problem
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Decidable expansions of labelled linear orderings
Fields of logic and computation
On Monadic theories of monadic predicates
Fields of logic and computation
Regular sets over extended tree structures
Theoretical Computer Science
Church synthesis problem with parameters
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Decidable theories of the ordering of natural numbers with unary predicates
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Decidability of MSO theories of tree structures
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
The Church problem for expansions of (N,
Information and Computation
| Hi-index | 0.00 |
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.