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

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

Источник Импакт-фактор Описание публикаций Год Число цитирований DOI
Нет данных
ELECTRONIC JOURNAL OF COMBINATORICS Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups? / Bulatov Andrei A.,Karpova Olga,Shur Arseny M.,Startsev Konstantin // ELECTRONIC JOURNAL OF COMBINATORICS. - 2017. - V. 24, l. 3. 2017 0
NATURAL COMPUTING More on quantum, stochastic, and pseudo stochastic languages with few states / Shur Arseny M.,Yakaryilmaz Abuzer // NATURAL COMPUTING. - 2016. - V. 15, l. 1, SI. - P. 129-141. 2016 2 10.1007/s11047-015-9511-8
(полный текст)
INFORMATION PROCESSING LETTERS Palindromic rich words and run-length encodings / Guo Chuan,Shallit Jeffrey,Shur Arseny M. // INFORMATION PROCESSING LETTERS. - 2016. - V. 116, l. 12. - P. 735-738. 2016 0 10.1016/j.ipl.2016.07.001
(полный текст)
Ternary Square-Free Partial Words with Many Wildcards / Gasnikov Daniil,Shur Arseny M. // . - 2016. - V. 9840, l. . - P. 177-189. 2016 0 10.1007/978-3-662-53132-7\_15
(полный текст)
FUNDAMENTA INFORMATICAE The Number of Distinct Subpalindromes in Random Words / Rubinchik Mikhail,Shur Arseny M. // FUNDAMENTA INFORMATICAE. - 2016. - V. 145, l. 3. - P. 371-384. 2016 0 10.3233/FI-2016-1366
(полный текст)
THEORETICAL COMPUTER SCIENCE Generating square-free words efficiently / Shur Arseny M. // THEORETICAL COMPUTER SCIENCE. - 2015. - V. 601, l. . - P. 67-72. 2015 0 10.1016/j.tcs.2015.07.027
(полный текст)
On the Tree of Ternary Square-Free Words / Petrova Elena A.,Shur Arseny M. // . - 2015. - V. 9304, l. . - P. 223-236. 2015 1 10.1007/978-3-319-23660-5\_19
(полный текст)
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 7/3-Power-Free Infinite Binary Words / Du Chen Fei,Shallit Jeffrey,Shur Arseny M. // INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE. - 2015. - V. 26, l. 8. - P. 1147-1165. 2015 0 10.1142/S01290541140016X
(полный текст)
Pal(k) is Linear Recognizable Online / Kosolobov Dmitry,Rubinchik Mikhail,Shur Arseny M. // . - 2015. - V. 8939, l. . - P. 289-301. 2015 2
THEORETICAL COMPUTER SCIENCE Searching for Zimin patterns / Rytter Wojciech,Shur Arseny M. // THEORETICAL COMPUTER SCIENCE. - 2015. - V. 571, l. . - P. 50-57. 2015 0 10.1016/j.tcs.2015.01.004
(полный текст)