Shur Arsenii Mihailovich

Publications in Math-Net.Ru

1. Calculating parameters and behavior types of combinatorial complexity for regular languages
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 16:2 (2010),  270–287
2. Growth rates of power-free languages
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 2009, no. 9,  82–88
3. Combinatorial complexity of rational languages
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 12:2 (2005),  78–99
4. Partial words and the interaction property of periods
   
   Izv. RAN. Ser. Mat., 68:2 (2004),  191–214
5. The structure of the set of cube-free $Z$-words in a two-letter alphabet
   
   Izv. RAN. Ser. Mat., 64:4 (2000),  201–224
6. On a class of formal languages
   
   Algebra Logika, 37:4 (1998),  478–492
7. Syntactical semigroups of avoidable languages
   
   Sibirsk. Mat. Zh., 39:3 (1998),  683–702
8. Binary avoidability and Thue–Morse words
   
   Dokl. Akad. Nauk, 348:5 (1996),  598–599