On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases

Simple item page
dc.creatorPritykin, Yuri
dc.date2007-04-02
dc.date.accessioned2026-07-07T07:54:24Z
dc.date.available2026-07-07T07:54:24Z
dc.descriptionIn 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.
dc.description9 pages. To be presented on 11th International Conference on Developments in Language Theory (DLT'2007), Turku, Finland, July 2007.
dc.identifierhttps://arxiv.org/abs/0704.0218
dc.identifierhttp://arxiv.org/abs/0704.0218
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126591
dc.subjectDiscrete Mathematics
dc.subjectLogic in Computer Science
dc.subjectG.2.1; F.2.2; F.4.3
dc.titleOn Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases
dc.typetext

Files

Collections

arXiv