2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/126591In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm solving the problem is found. A result more or less supporting the conjecture of decidability of the general problem is given.9 pages. To be presented on 11th International Conference on Developments in Language Theory (DLT'2007), Turku, Finland, July 2007.Discrete MathematicsLogic in Computer ScienceG.2.1; F.2.2; F.4.3text