, ?? ??????????? ????? 12, ????? b + c ????? ???? ????? 4n,2n,2n + 1 ? 2n ? 1. ???????????? ????????? ??????????? ?????????, ??????????????? ???? (b,c) ? b + c = 4n ???????? ?????????? ? ??? ??????????? ??? ????????? ????? Ci ? ({1}), ??? ??? ????????? ???????? ???????????? ??? ????? Ci ? (I on ) ??? ?????? ???????????? n

. ?????-b-+-c-=-2n, ?? ??????????? ????? 12, ?????? ??????????? ?????????, ??????????????? ???? (b,c) ?????????? ? ?????? ??????? 4n. ?????????? ???? Ci 4n (I on ) = (V,E) ? V = {0,1,2, . . . , 4n ? 1}. ?? ??????????? 1, ?????? ??????????? ????????? ? ????? ???-?? ????????? ??????????? ????????? ????? Ci ? (I on ) ? ????????

. ?????-b-+-c-=-2n-+-1, ?? ??????????? ????? 14, ?????? ??????????? ?????????, ??????????????? ???? (b,c) ???? ??????? ?? ???????????? (2n ? 1)-?????, ???? ????? ?????? 2n + 1. ?????????? ????? Ci 4n+2 (I on )

, ????????? ??? ??????????? ??????-??? ??????? ? ????????? 3.3. ?????? ????????? ? ????? Ci 4n?2 (I on ) ????????? ??????????? ????????? ????? Ci ? (I on ) ? ????????, ????? b + c = 2n ? 1. ?? ??????????? ????? 15 ?????? ??????????? ?????????

, ??? ?????????? ???????? ????????? ??????????? ????????? ?????

, Ci ? (I on ) ?????????? ??????????? ????????? ?????? Ci t (I on )

, ?????????? ???????? ?????????? ?????? ??????????? ? ?????????

, ???????? ?????? ??????? ?????? ????? ?????????? ?????????????? ?????????????????????? ? ?????????? ????? ???-????? ??? ??????-??? ??????? ????????

, ???????? ??????? ? ?????? ?????? ?? ???????? ??????????????? ??-????? ? ?????????? ????? ???-????? ??? ????????? ??????? ?????-???

, ???????? ?????? ??????? ??? ??????? ???????? (? ??? ?????????, ????????) ????????? ? ?????? ????-????

, ????????? ?????? ???????? ??????????? ????????? ? ??? ????? ?????-?????? ???????????? ?????? ? ??????? ????????? {1,2,3

, ??????? ???????? ????????????? ???????? ???????? ??? ??????????? ???????????? ???????????, ??????????? ???????? ???? ???, ? ??????-?? ?????????? ?????? ?????? ?? ????????? ??????? ???????? ??????? ? ??????????? ????????? ????????????

A. Thue, Uber die gegenseitige Lage gleicher Teile Gewisser Zeichenreichen // Skr. Vid.-Kristiana I. Mat. Naturv. Klasse. -1912, pp.1-67

M. Morse, Recurrent Geodesics on a Surface of Negative Curvature // Transactions of the, vol.22, pp.84-100

B. L. Van-der-waerden, Beweis einer Baudetschen Vermutung // Nieuw Arch. Wisk. -1927. -?. 15, pp.212-216

E. Szemerédi, On sets of integers containing no k elements in arithmetic progression // Acta Arith, Collection of articles in memory of Ju. V. Linnik, vol.27, pp.199-245, 1975.

M. Morse and G. Hedlund, Symbolic dynamics // Amer, J. Math, vol.60, pp.815-866, 1938.

, Selected papers in honor of Jean Berstel, vol.292, pp.9-31, 2003.

, Cyclic complexity of words / J. Cassaigne, J. Combin. Theory Ser, vol.145, pp.36-56

E. Charlier, S. Puzynina, and L. Q. Zamboni, On a group theoretic generalization of the Morse-Hedlund theorem, Proceedings of the AMS, vol.145, pp.3381-3394
URL : https://hal.archives-ouvertes.fr/hal-01829320

E. M. Coven and G. A. Hedlund, Sequences with minimal block growth // Math. Systems Theory. -1973, vol.7, pp.138-153

J. Peltomäki, Introducing privileged words: privileged complexity of Sturmian words // Theoret, Comput. Sci. -2013, vol.500, pp.57-67

G. Richomme, K. Saari, and L. Zamboni, Abelian complexity of minimal subshifts, J. Lond. Math. Soc, vol.83, issue.2, pp.79-95, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00598086

T. Kamae and L. Q. Zamboni, Sequence entropy and the maximal pattern complexity of infinite words // Ergodic Theory Dynam. Systems, vol.22, pp.1191-1199

S. V. Avgustinovich, D. G. Fon-der-flaass, and A. E. Frid, Arithmetical complexity of infinite words // Words, Languages and Combinatorics III, pp.51-62, 2003.

J. Cassaigne and A. Frid, On the arithmetical complexity of Sturmian words // Theoret, Comput. Sci, vol.380, pp.304-316, 2007.

A. Frid, Theoret. Comput. Sci, pp.68-87

S. Avgustinovich, J. Cassaigne, and A. Frid, Theoret. Inform. Appl, vol.40, pp.569-582, 2006.

A. Frid, On possible growths of arithmetical complexity // Theoret, Inform. Appl, vol.40, pp.443-458, 2006.

O. G. Parshina, On arithmetic progressions in the generalized Thue-Morse word, Combinatorics on Words. WORDS 2015. Lecture Notes in Computer Science. -2015, vol.9304, pp.191-196

O. G. Parshina, On arithmetic index in the generalized Thue-Morse word, Combinatorics on Words. WORDS 2017. Lecture Notes in Computer Science, vol.10432, pp.121-131
URL : https://hal.archives-ouvertes.fr/hal-02097157

?. ?. ???????, ? ?????? ?????????????? ?????????? ? ????? ???-???-?? // ????????? 52-? ????????????? ??????? ???????????? ????????-??? "??????? ? ??????-??????????? ???????? ??????????, ?????? 2014 ?.) -???????????: ???????????-???????????? ????? ???, pp.11-18, 2014.

?. ?. ???????, ?????????? ?????????????? ?????????? ? ????? ???-???-?? // ????????? 53-? ????????????? ??????? ???????????? ????????-??? "??????? ? ??????-??????????? ???????? ??????????, ?????? 2015 ?.) -???????????: ???????????-???????????? ????? ???, vol.124, pp.11-17, 2015.

/. A. Palindromic-richness and . Glen, , vol.30, pp.510-531

M. Bucci, A. De-luca, and G. Fici, Enumeration and Structure of Trapezoidal Words // Theoret, Comput. Sci, vol.468, pp.12-22, 2013.

A. Carpi and A. De-luca, Periodic-like words, periodicity and boxes // Acta. Inform, vol.37, pp.597-618

G. Fici, Open and closed words // Bull, Eur. Assoc. Theor. Comput. Sci. EATCS, vol.123, pp.138-147

P. Arnoux and G. Rauzy, Représentation géométrique de suites de complexité 2n+ 1 // Bull. Soc. Math.France. -1991. -?. 119, ? 2, pp.199-215

O. G. Parshina and L. Zamboni, Open and closed factors in Arnoux-Rauzy words, Advances in Applied Mathematics. -2019, vol.107, pp.22-31
URL : https://hal.archives-ouvertes.fr/hal-02072987

O. G. Parshina and L. Q. Zamboni, Open and closed factors in Arnoux-Rauzy words // Abstracts of the conference, Mons Theoretical Computer Science Days, pp.17-20, 2018.

J. Berstel and L. Boasson, Comp. Sci. -1999, vol.218, pp.135-141

?. ?. ???????, ? ??????????? 2-?????????? ????????? ??????????? // ????????? 50-? ????????????? ??????? ???????????? ??????????? "???-???? ? ??????-??????????? ???????? ??????????, ?????? 2012 ?.) -???????????: ???????????-???????????? ????? ???, p.142, 2012.

?. ?. ???????, ??????????? 2-????????? ??????????? ???????????? ???-??? ?? ???????? ??????? ????????? // ????????. ?????? ? ??????. ?????-???. -2014. -?. 21, ? 2. -?. 76-83. -(???????: Parshina O. G. Perfect 2-colorings of infinite circulant graphs with a continuous set of distances, J. Appl. Industr. Math, pp.357-361, 2014.

O. G. Parshina and M. A. Lisitsyna, Perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances // Abstracts of the International Conference and PhD Summer School "Groups and Graphs, Representations and relations, 2018.

?. ???????, ??????????? 2-????????? ??????????? ???????????? ???-??? ?? ???????? ??????? ????????? // ????????????? ??????????? ??????????? ?????? (12-16 ?????? 2012 ?.) ?????? ????????

O. G. Parshina, Perfect k-colorings of infinite circulant graphs with a continuous set of distances // Abstracts of the International Conference and PhD Summer School "Groups and Graphs, Algorithms and Automata, 2015.

?. ?. ???????, ??????????? ????????? ???????? ???????????? ???-??? // ????????? 51-? ????????????? ??????? ???????????? ????????-??? "??????? ? ??????-??????????? ???????? ??????????, ?????? 2013 ?.) -???????????: ???????????-???????????? ????? ???, p.226, 2013.

?. ?. ???????? and ?. ?. ???????, ??????????? ????????? ???????????? ????????????? ????? ? ??????????? 1 ? 2 // ????????. ?????? ? ??????. ????, vol.24, pp.5-19

M. A. Axenovich, On multiple coverings of the infinite rectangular grid with balls of constant radius // Discrete Math, vol.268, pp.31-48

?. ?. ????????, ??????????? ????????? ??????????? ????????????? ??-????? : ???. ?? ????????? ?????? ??????? ????, ???????????, vol.79, 2008.

D. S. Krotov, Perfect colorings of Z 2 : Nine colors, 2009.

?. ?. ????????????, ?. ?. ?????????, and ?. ?. ????????, ???????????? ????-?????? ????????? ??????????? ?????????? ???e??? // ????????. ?????? ? ??????. ????, vol.18, pp.3-10

S. A. Puzynina, On periodicity of perfect colorings of the infinite hexagonal and triangular grids // Sib Math, vol.52, pp.91-104

A. Y. Vasil'eva, Distance regular colorings of the infinite triangular grid // Collection of Abstracts of the International Conference "Mal'tsev Meeting

S. V. Avgustinovich, D. S. Krotov, and A. Y. Vasileva, Completely regular codes in the infinite hexagonal grid // Siberian Electronic Mathematical Reports, vol.13, pp.987-1016, 2016.

?. ?. ??????????, ? ??????????? ??????????? ?????????? ? ??? ????? // ???????. ?????? ? ??????. ????????. -2009. -?. 16, ? 1, pp.80-92

?. ?. ??????????, ? ?????????? ??????????? 2-????????? ???????????? ?????? // ???????. ?????? ? ??????. ????????. -2011. -?. 18, ? 6, pp.82-89

?. ?. ???-???-??????, ??????????? 2-????????? ????????? // ???. ?????. ????. -2007. -?. 48, ? 4, pp.923-930

D. G. Fon-der-flaass, A bound on correlation immunity // Siberian Electronic Mathematical Reports, vol.4, pp.133-135

?. ?. ???-???-??????, ??????????? 2-????????? 12-??????? ????, ???????-???? ??????? ?????????????? ?????????? // ???. ????????. ???. ???, pp.292-295

?. ?. ????????, ???-???-?????? ?. ?. ? ??????????? 2-?????????? ??-??????? // ???. ????????. ???. ???. -2010, pp.65-75

W. J. Martin, Completely Regular Designs, J. Combin. Designs, vol.6, pp.261-273, 1998.

?. ?. ?????????, ??????????? 2-????????? ?????? ???????? : ???. ?? ????????? ?????? ??????? ????, ???????????, 2010.

A. L. Gavrilyuk and S. V. Goryainov, On Perfect 2-Colorings of, J. Combin. Designs. -2013, vol.21, issue.6, pp.232-252

?. ?. ???????????? and ?. ?. ????????, ??????????? 2-????????? ????-???????? ?????????? ?????? // ???????. ?????? ? ??????. ????????, J. Appl. Industr. Math, pp.519-528, 2011.

?. ?. ???????? and ?. ????????????, ??????????? ????????? ?????? // ???. ????????. ???. ???. -2016. -?. 13, pp.1116-1128

?. ?. ???????????? and ?. ?. ???????, ?????? ??????? ???????? ???????? ? ???????????-???????????? ???????? ????????????? // ???

A. Vardy, Algorithmic Complexity in Coding Theory and the Minimum Distance Problem // Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, pp.92-109, 1997.

E. R. Berlekamp, R. J. Mceliece, and H. C. Van-tilborg, On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, issue.24, pp.384-386, 1978.

A. Ehrenfeucht, K. Lee, and G. Rozenberg, Subword complexities of various classes of deterministic developmental languages without interactions // Theoret, Comput. Sci, vol.1, pp.59-75, 1975.

R. Tijdeman, L. Q. Zamboni, and . Fine, , vol.14, pp.135-147, 2003.

J. Berstel, Sturmian and episturmian words(A survey of some recent results) // Proceedings of CAI, vol.4728, pp.23-47

X. Droubay, J. Justin, and G. Pirillo, Episturmian words and some constructions of de Luca and Rauzy // Theoret, Comput. Sci, vol.255, pp.539-553, 2001.

J. J. Pirillo and G. , Episturmian words and episturmian morphisms // Theoret, Comput. Sci, vol.276, pp.281-313, 2002.

L. Schaeffer and J. Shallit, Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences // Electron, vol.23, pp.1-25

A. De-luca, Sturmian words: structure, combinatorics and their arithmetics // Theoret. Comput. Sci. -1997, vol.183, pp.45-82

D. Cvetkovi?, M. Doob, and H. Sachs, Spectra of Graphs: Theory and Application, vol.368, p.pp, 1980.

M. Dinitz, Full rank tilings of finite abelian groups // SIAM, J. Discrete Math, vol.2006, issue.20, pp.160-170

D. K. Zhukov, Tilings of p-ary cyclic groups // IEEE Trans, pp.562-565