Overlap-Free Words and Thue-Morse Sequences. - Arseny M. Shur (Int. J. Algebra Comput., 1996)

On the Periods of Partial Words. - Arseny M. Shur; Yulia V. Konovalova (MFCS, 2001)

Factorial Languages of Low Combinatorial Complexity. - Arseny M. Shur (Developments in Language Theory, 2006)

Rational Approximations of Polynomial Factorial Languages. - Arseny M. Shur (Int. J. Found. Comput. Sci., 2007)

Combinatorial Complexity of Regular Languages. - Arseny M. Shur (CSR, 2008)

Comparing Complexity Functions of a Language and Its Extendable Part. - Arseny M. Shur (RAIRO Theor. Informatics Appl., 2008)

Two-Sided Bounds for the Growth Rates of Power-Free Languages. - Arseny M. Shur (Developments in Language Theory, 2009)

On intermediate factorial languages. - Arseny M. Shur (Discret. Appl. Math., 2009)

Polynomial languages with finite antidictionaries. - Arseny M. Shur (RAIRO Theor. Informatics Appl., 2009)

On the Existence of Minimal beta-Powers. - Arseny M. Shur (Developments in Language Theory, 2010)

On Ternary Square-free Circular Words. - Arseny M. Shur (Electron. J. Comb., 2010)

Numerical values of the growth rates of power-free languages - Arseny M. Shur (CoRR, 2010)

Combinatorial Characterization of Formal Languages - Arseny M. Shur (CoRR, 2010)

On the growth rates of complexity of threshold languages. - Arseny M. Shur; Irina A. Gorbunova (RAIRO Theor. Informatics Appl., 2010)

Growth rates of complexity of power-free languages. - Arseny M. Shur (Theor. Comput. Sci., 2010)

Two Combinatorial Criteria for BWT Images. - Konstantin M. Likhomanov; Arseny M. Shur (CSR, 2011)

On Brzozowski's Conjecture for the Free Burnside Semigroup Satisfying x2 = x3. - Andrey N. Plyushchenko; Arseny M. Shur (Developments in Language Theory, 2011)

Fife's Theorem for (7/3)-Powers - Narad Rampersad; Jeffrey O. Shallit; Arseny M. Shur (WORDS, 2011)

Almost Overlap-Free Words and the Word Problem for the Free Burnside Semigroup Satisfying X2 = X3. - Andrey N. Plyushchenko; Arseny M. Shur (Int. J. Algebra Comput., 2011)

On the existence of Minimal β-powers. - Arseny M. Shur (Int. J. Found. Comput. Sci., 2011)

Constructing Premaximal Ternary Square-Free Words of Any Level. - Elena A. Petrova; Arseny M. Shur (MFCS, 2012)

On Two Stronger Versions of Dejean's Conjecture. - Igor N. Tunev; Arseny M. Shur (MFCS, 2012)

Growth properties of power-free languages. - Arseny M. Shur (Comput. Sci. Rev., 2012)

On Pansiot Words Avoiding 3-Repetitions. - Irina A. Gorbunova; Arseny M. Shur (Int. J. Found. Comput. Sci., 2012)

Constructing Premaximal Binary Cube-Free Words of any Level. - Elena A. Petrova; Arseny M. Shur (Int. J. Found. Comput. Sci., 2012)

On Abelian repetition threshold. - Alexey V. Samsonov; Arseny M. Shur (RAIRO Theor. Informatics Appl., 2012)

Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth. - Arseny M. Shur (Developments in Language Theory, 2013)

Finding Distinct Subpalindromes Online. - Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur (Stringology, 2013)

Quantum, Stochastic, and Pseudo Stochastic Languages with Few States. - Arseny M. Shur; Abuzer Yakaryilmaz (UCNC, 2014)

$ mathrm{Pal}^k$ Is Linear Recognizable Online. - Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur (CoRR, 2014)

Periodic Partial Words and Random Bipartite Graphs. - Lidia A. Idiatulina; Arseny M. Shur (Fundam. Informaticae, 2014)

Languages with a Finite antidictionary: some growth Questions. - Arseny M. Shur (Int. J. Found. Comput. Sci., 2014)

Binary patterns in binary cube-free words: Avoidability and growth. - Robert Mercas; Pascal Ochem; Alexey V. Samsonov; Arseny M. Shur (RAIRO Theor. Informatics Appl., 2014)

Growth of Power-Free Languages over Large Alphabets. - Arseny M. Shur (Theory Comput. Syst., 2014)

On the Tree of Ternary Square-Free Words. - Elena A. Petrova; Arseny M. Shur (WORDS, 2015)

Pal k is Linear Recognizable Online. - Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur (SOFSEM, 2015)

On the Combinatorics of Palindromes and Antipalindromes. - Chuan Guo 001; Jeffrey O. Shallit; Arseny M. Shur (CoRR, 2015)

Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words. - Chen Fei Du; Jeffrey O. Shallit; Arseny M. Shur (Int. J. Found. Comput. Sci., 2015)

Searching for Zimin patterns. - Wojciech Rytter; Arseny M. Shur (Theor. Comput. Sci., 2015)

Generating square-free words efficiently. - Arseny M. Shur (Theor. Comput. Sci., 2015)

Ternary Square-Free Partial Words with Many Wildcards. - Daniil Gasnikov; Arseny M. Shur (DLT, 2016)

The Number of Distinct Subpalindromes in Random Words. - Mikhail Rubinchik; Arseny M. Shur (Fundam. Informaticae, 2016)

Preface. - Arseny M. Shur (Int. J. Found. Comput. Sci., 2016)

Palindromic rich words and run-length encodings. - Chuan Guo 001; Jeffrey O. Shallit; Arseny M. Shur (Inf. Process. Lett., 2016)

More on quantum, stochastic, and pseudo stochastic languages with few states. - Arseny M. Shur; Abuzer Yakaryilmaz (Nat. Comput., 2016)

Palindromic Length in Linear Time. - Kirill Borozdin; Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur (CPM, 2017)

On the Tree of Binary Cube-Free Words. - Elena A. Petrova; Arseny M. Shur (DLT, 2017)

Counting Palindromes in Substrings. - Mikhail Rubinchik; Arseny M. Shur (SPIRE, 2017)

On the Size of Lempel-Ziv and Lyndon Factorizations. - Juha Kärkkäinen; Dominik Kempa; Yuto Nakashima 001; Simon J. Puglisi; Arseny M. Shur (STACS, 2017)

Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups? - Andrei A. Bulatov; Olga Karpova; Arseny M. Shur; Konstantin Startsev (Electron. J. Comb., 2017)

EERTREE: An efficient data structure for processing palindromes in strings. - Mikhail Rubinchik; Arseny M. Shur (Eur. J. Comb., 2018)

Square-Free Partial Words with Many Wildcards. - Daniil Gasnikov; Arseny M. Shur (Int. J. Found. Comput. Sci., 2018)

Searching Long Repeats in Streams. - Oleg Merkurev; Arseny M. Shur (CPM, 2019)

Searching Runs in Streams. - Oleg Merkurev; Arseny M. Shur (SPIRE, 2019)

Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. - Pawel Gawrychowski; Oleg Merkurev; Arseny M. Shur; Przemyslaw Uznanski (Algorithmica, 2019)

Comparison of LZ77-type parsings. - Dmitry Kosolobov; Arseny M. Shur (Inf. Process. Lett., 2019)

Subword complexity and power avoidance. - Jeffrey O. Shallit; Arseny M. Shur (Theor. Comput. Sci., 2019)

Palindromic k-Factorization in Pure Linear Time. - Mikhail Rubinchik; Arseny M. Shur (MFCS, 2020)

String periods in the order-preserving model. - Garance Gourdel; Tomasz Kociumaka; Jakub Radoszewski; Wojciech Rytter; Arseny M. Shur; Tomasz Walen (Inf. Comput., 2020)

Branching Frequency and Markov Entropy of Repetition-Free Languages. - Elena A. Petrova; Arseny M. Shur (DLT, 2021)

Branching Densities of Cube-Free and Square-Free Words. - Elena A. Petrova; Arseny M. Shur (Algorithms, 2021)

Words Separation and Positive Identities in Symmetric Groups. - Olga Karpova; Arseny M. Shur (J. Autom. Lang. Comb., 2021)

Transition Property for Cube-Free Words. - Elena A. Petrova; Arseny M. Shur (Theory Comput. Syst., 2021)

Abelian Repetition Threshold Revisited. - Elena A. Petrova; Arseny M. Shur (CSR, 2022)

Computing The Maximum Exponent in a Stream. - Oleg Merkurev; Arseny M. Shur (Algorithmica, 2022)

On minimal critical exponent of balanced sequences. - L'ubomíra Dvoráková; Edita Pelantová; Daniela Opocenská; Arseny M. Shur (Theor. Comput. Sci., 2022)

Approaching Repetition Thresholds via Local Resampling and Entropy Compression. - Arseny M. Shur (DLT, 2023)

New constructions for 3-free and 3+-free binary morphisms. - Jeffrey O. Shallit; Arseny M. Shur; Stefan Zorcic (CoRR, 2023)

Searching 2D-Strings for Matching Frames. - Itai Boneh; Dvir Fried; Shay Golan 001; Matan Kraus; Adrian Miclaus; Arseny M. Shur (CPM, 2024)

String 2-Covers with No Length Restrictions. - Itai Boneh; Shay Golan 001; Arseny M. Shur (ESA, 2024)

Distance Labeling for Families of Cycles. - Arseny M. Shur; Mikhail Rubinchik (SOFSEM, 2024)

Power-free complementary binary morphisms. - Jeffrey O. Shallit; Arseny M. Shur; Stefan Zorcic (J. Comb. Theory, Ser. A, 2024)

Non-Constructive Upper Bounds for Repetition Thresholds. - Arseny M. Shur (Theory Comput. Syst., 2024)

Expected Density of Random Minimizers. - Shay Golan 001; Arseny M. Shur (SOFSEM (1), 2025)

On Minimizers of Minimum Density. - Arseny M. Shur (CoRR, 2025)