RUS
ENG
Full version
JOURNALS
// Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
// Archive
Dokl. RAN. Math. Inf. Proc. Upr.,
2025
Volume 525,
Pages
52–56
(Mi danma712)
MATHEMATICS
Periodicity of morphic words
A. Ya. Belov
a
,
I. V. Mitrofanov
,
A. Allemand
b
a
Moscow Institute of Physics and Technology (National Research University), Dolgoprudny, Moscow Region
b
Lomonosov Moscow State University
Abstract:
In this paper, we prove the decidability of the ultimate periodicity problem (the HD0L periodicity problem).
Keywords:
combinatorics of words, morphic sequence, HD0L-system, decidability.
UDC:
517.54
Presented:
A. L. Semenov
Received: 16.06.2025
Revised: 18.08.2025
Accepted: 27.08.2025
DOI:
10.7868/S3034504925050071
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2026