|
|
|
Publications in Math-Net.Ru |
Citations |
|
2010 |
| 1. |
A. M. Shur, “Calculating parameters and behavior types of combinatorial complexity for regular languages”, Trudy Inst. Mat. i Mekh. UrO RAN, 16:2 (2010), 270–287   |
3
|
|
2009 |
| 2. |
A. M. Shur, “Growth rates of power-free languages”, Izv. Vyssh. Uchebn. Zaved. Mat., 2009, no. 9, 82–88   ; Russian Math. (Iz. VUZ), 53:9 (2009), 73–78 |
4
|
|
2005 |
| 3. |
A. M. Shur, “Combinatorial complexity of rational languages”, Diskretn. Anal. Issled. Oper., Ser. 1, 12:2 (2005), 78–99 |
15
|
|
2004 |
| 4. |
A. M. Shur, Yu. V. Gamzova, “Partial words and the interaction property of periods”, Izv. RAN. Ser. Mat., 68:2 (2004), 191–214 ; Izv. Math., 68:2 (2004), 405–428   |
13
|
|
2000 |
| 5. |
A. M. Shur, “The structure of the set of cube-free $Z$-words in a two-letter alphabet”, Izv. RAN. Ser. Mat., 64:4 (2000), 201–224 ; Izv. Math., 64:4 (2000), 847–871 |
28
|
|
1998 |
| 6. |
E. V. Sukhanov, A. M. Shur, “On a class of formal languages”, Algebra Logika, 37:4 (1998), 478–492 |
| 7. |
A. M. Shur, “Syntactical semigroups of avoidable languages”, Sibirsk. Mat. Zh., 39:3 (1998), 683–702 ; Siberian Math. J., 39:3 (1998), 594–610 |
2
|
|
1996 |
| 8. |
A. M. Shur, “Binary avoidability and Thue–Morse words”, Dokl. Akad. Nauk, 348:5 (1996), 598–599 |
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: