Browsing by Author Shur, A. M.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я
or enter first few letters:  
Showing results 1 to 20 of 27  next >
Issue DateTitleAuthor(s)
2022Abelian Repetition Threshold RevisitedPetrova, E. A.; Shur, A. M.
2011Almost Overlap-free Words and the Word Problem for the Free Burnside Semigroup Satisfying x2 = x3Plyushchenko, A. N.; Shur, A. M.
2014Binary patterns in binary cube-free words: Avoidability and growthMercaş, R.; Ochem, P.; Samsonov, A. V.; Shur, A. M.
2021Branching densities of cube-free and square-free wordsPetrova, E. A.; Shur, A. M.
2021Branching Frequency and Markov Entropy of Repetition-Free LanguagesPetrova, E. A.; Shur, A. M.
2008Comparing Complexity Functions of a Language and Its Extendable PartShur, A. M.
2019Comparison of LZ77-type parsingsKosolobov, D.; Shur, A. M.
2011Constructing Premaximal Binary Cube-Free Words of Any LevelPetrova, E. A.; Shur, A. M.
2018EERTREE: An efficient data structure for processing palindromes in stringsRubinchik, M.; Shur, A. M.
2016EERTREE: An efficient data structure for processing palindromes in stringsRubinchik, M.; Shur, A. M.
2015Generating square-free words efficientlyShur, A. M.
2010Growth Rates of Complexity of Power-Free LanguagesShur, A. M.
2017Lower bounds on words separation: Are there short identities in transformation semigroups?Bulatov, A. A.; Karpova, O.; Shur, A. M.; Startsev, K.
2016The Number of Distinct Subpalindromes in Random WordsRubinchik, M.; Shur, A. M.
2009On intermediate Factorial LanguagesShur, A. M.
2022On minimal critical exponent of balanced sequencesDvořáková, L.; Pelantová, E.; Opočenská, D.; Shur, A. M.
2011On Pansiot Words Avoiding 3-RepetitionsGorbunova, I. A.; Shur, A. M.
2010On Ternary Square-Free Circular WordsShur, A. M.
2010On the Growth Rates of Complexity of Threshold LanguagesShur, A. M.; Gorbunova, I. A.
2016Palindromic rich words and run-length encodingsGuo, C.; Shallit, J.; Shur, A. M.