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

Публикации
Дата обновления: 07.12.2017

Источник Импакт-фактор Описание публикаций Год Число цитирований DOI
Нет данных
On Two Stronger Versions of Dejean's Conjecture / Tunev Igor N.,Shur Arseny M. // . - 2012. - V. 7464, l. . - P. 800-812. 2012 0
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION ALMOST OVERLAP-FREE WORDS AND THE WORD PROBLEM FOR THE FREE BURNSIDE SEMIGROUP SATISFYING x(2) = x(3) / Plyushchenko Andrey N.,Shur Arseny M. // INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION. - 2011. - V. 21, l. 6. - P. 973-1006. 2011 2 10.1142/S0218196711006558
(полный текст)
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE ON THE EXISTENCE OF MINIMAL beta-POWERS / Shur Arseny M. // INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. - 2011. - V. 22, l. 7, SI. - P. 1683-1696. 2011 2 10.1142/S0129054111008969
(полный текст)
DOKLADY MATHEMATICS Growth of Power-Free Languages: Numerical and Asymptotic Bounds / Shur A. M. // DOKLADY MATHEMATICS. - 2010. - V. 81, l. 3. - P. 406-409. 2010 0 10.1134/S1064562410030191
(полный текст)
THEORETICAL COMPUTER SCIENCE Growth rates of complexity of power-free languages / Shur Arseny M. // THEORETICAL COMPUTER SCIENCE. - 2010. - V. 411, l. 34-36. - P. 3209-3223. 2010 10 10.1016/j.tcs.2010.05.017
(полный текст)
ELECTRONIC JOURNAL OF COMBINATORICS On ternary square-free circular words / Shur Arseny M. // ELECTRONIC JOURNAL OF COMBINATORICS. - 2010. - V. 17, l. 1. 2010 4
On the Existence of Minimal beta-Powers / Shur Arseny M. // . - 2010. - V. 6224, l. . - P. 411-422. 2010 2
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS ON THE GROWTH RATES OF COMPLEXITY OF THRESHOLD LANGUAGES / Shur Arseny M.,Gorbunova Irina A. // RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS. - 2010. - V. 44, l. 1, SI. - P. 175-192. 2010 9 10.1051/ita/2010012
(полный текст)
DISCRETE APPLIED MATHEMATICS On intermediate factorial languages / Shur Arseny M. // DISCRETE APPLIED MATHEMATICS. - 2009. - V. 157, l. 7. - P. 1669-1675. 2009 2 10.1016/j.dam.2008.09.007
(полный текст)
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS POLYNOMIAL LANGUAGES WITH FINITE ANTIDICTIONARIES / Shur Arseny M. // RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS. - 2009. - V. 43, l. 2. - P. 269-279. 2009 1 10.1051/ita:2008028
(полный текст)