Geodesic
Periodicity of morphic words
Fundamentalʹnaâ i prikladnaâ matematika, Tome 18 (2013) no. 4, pp. 107-119.

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper, we prove the decidability of the ultimate periodicity problem (the HD0L periodicity problem). 
@article{FPM_2013_18_4_a7,
     author = {I. V. Mitrofanov},
     title = {Periodicity of morphic words},
     journal = {Fundamentalʹna\^a i prikladna\^a matematika},
     pages = {107--119},
     publisher = {mathdoc},
     volume = {18},
     number = {4},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/FPM_2013_18_4_a7/}
}
TY  - JOUR
AU  - I. V. Mitrofanov
TI  - Periodicity of morphic words
JO  - Fundamentalʹnaâ i prikladnaâ matematika
PY  - 2013
SP  - 107
EP  - 119
VL  - 18
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/FPM_2013_18_4_a7/
LA  - ru
ID  - FPM_2013_18_4_a7
ER  - 
%0 Journal Article
%A I. V. Mitrofanov
%T Periodicity of morphic words
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2013
%P 107-119
%V 18
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/FPM_2013_18_4_a7/
%G ru
%F FPM_2013_18_4_a7
I. V. Mitrofanov. Periodicity of morphic words. Fundamentalʹnaâ i prikladnaâ matematika, Tome 18 (2013) no. 4, pp. 107-119. http://geodesic.mathdoc.fr/item/FPM_2013_18_4_a7/

[1] Muchnik An. A., Pritykin Yu. L., Semënov A. L., “Posledovatelnosti, blizkie k periodicheskim”, Uspekhi mat. nauk, 64:5 (2009), 21–96 | DOI | MR | Zbl

[2] Allouche J.-P., Shallit J., Automatic Sequences: Theory, Applications, Generalizations, Cambridge Univ. Press, Cambridge, 2003 | MR | Zbl

[3] Durand F., Decidability of the HD0L ultimate periodicity problem, arXiv: 1111.3268v1 | MR

[4] Durand F., “HD0L $\omega$-equivalence and periodicity problems in the primitive case (to the memory of G. Rauzy)”, J. Uniform Distrib. Theory, 7:1 (2012), 199–215 | MR | Zbl

[5] Ehrenfeucht A., Rozenberg G., “Repetition of subwords in DOL languages”, J. Inform. Control, 59:1–3 (1983), 13–35 | DOI | MR | Zbl

[6] Harju T., Linna M., “On the periodicity of morphisms on free monoids”, Inform. Théor. Appl., 20:1 (1986), 47–54 | MR | Zbl

[7] Honkala J., “A decision method for the recognizability of sets defined by number systems”, Inform. Théor. Appl., 20:4 (1986), 395–403 | MR | Zbl

[8] Honkala J., Rigo M., “Decidability questions related to abstract numeration systems”, Discrete Math., 285:1–3 (2004), 329–333 | DOI | MR | Zbl

[9] Kanel-Belov A., Mitrofanov I., Periodicity of Rauzy scheme and substitutional systems, arXiv: 1107.0185[math.DS]

[10] Mitrofanov I., A proof for the decidability of HD0L ultimate periodicity, arXiv: 1110.4780

[11] Nicolas F., Pritykin Yu., “On uniformly recurrent morphic sequences”, Int. J. Foundations Comput. Sci., 20:5 (2009), 919–940 | DOI | MR | Zbl

[12] Pansiot J.-J., “Complexité des facteurs des mots infinis engendrés par morphismes itérés”, Proc. ICALP' 84, Lect. Notes Comput. Sci., 172, Springer, Berlin, 1984, 380–389 | DOI | MR

[13] Pansiot J.-J., “Decidability of periodicity for infinite words”, Inform. Théor. Appl., 20:1 (1986), 43–46 | MR | Zbl

[14] Rigo M., Maes A., “More on generalized automatic sequences”, J. Automata, Languages and Combinatorics, 7:3 (2002), 351–376 | MR | Zbl