Шур Арсений Михайлович

Источник	Импакт-фактор	Описание публикаций	Год	Число цитирований	DOI
Нет данных
—	—	Two-Sided Bounds for the Growth Rates of Power-Free Languages / Shur Arseny M. // . - 2009. - V. 5583, l. . - P. 466-477.	2009	11	—
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS	—	Comparing complexity functions of a language and its extendable part / Shur Arseny M. // RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS. - 2008. - V. 42, l. 3. - P. 647-655.	2008	10	10.1051/ita:2008021 (полный текст)
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE	—	Rational approximations of polynomial factorial languages / Shur Arseny M. // INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. - 2007. - V. 18, l. 3. - P. 655-665.	2007	2	10.1142/S0129054107004887 (полный текст)
—	—	Factorial languages of low combinatorial complexity / Shur Arseny M. // . - 2006. - V. 4036, l. . - P. 397-407.	2006	3	—
—	—	On the periods of partial words / Shur AM,Konovalova YV // . - 2001. - V. 2136, l. . - P. 657-665.	2001	14	—
DOKLADY AKADEMII NAUK	—	Binary avoidability and Thue-Morse words / Shur AM // DOKLADY AKADEMII NAUK. - 1996. - V. 348, l. 5. - P. 598-599.	1996	0	—
SEMIGROUP FORUM	—	Binary words avoided by the Thue-Morse sequence / Shur AM // SEMIGROUP FORUM. - 1996. - V. 53, l. 2. - P. 212-219.	1996	4	10.1007/BF02574136 (полный текст)
1 2 3 4