Morphisms and Almost-periodicity. - Arnaud Maes (Discret. Appl. Math., 1998)

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

More on morphisms and almost-periodicity. - Arnaud Maes (Theor. Comput. Sci., 2000)

More on Generalized Automatic Sequences. - Michel Rigo; Arnaud Maes (J. Autom. Lang. Comb., 2002)