An effective solution to the DOL periodicity problem in the binary case. (English) Zbl 0678.68072

A complete characterization of the ultimately periodic binary words which can be generated by infinitely iterated morphisms and also the corresponding morphisms is given. The latter characterization is closely related to the result obtained by T. Harju and M. Linna [Theor. Comput. Sci. 33, 327-329 (1984; Zbl 0548.20044)]. A new solution of the DOL periodicity problem in the binary case is also presented.
Reviewer: M.Linna


68Q45 Formal languages and automata
68R99 Discrete mathematics in relation to computer science


Zbl 0548.20044