The following pages link to Arseny M. Shur (Q444678):
Displaying 50 items.
- Deciding context equivalence of binary overlap-free words in linear time (Q444679) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- Generating square-free words efficiently (Q496050) (← links)
- Growth of power-free languages: numerical and asymptotic bounds (Q610578) (← links)
- On ternary square-free circular words (Q612919) (← links)
- Palindromic rich words and run-length encodings (Q738876) (← links)
- Branching frequency and Markov entropy of repetition-free languages (Q832956) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- On intermediate factorial languages (Q1028151) (← links)
- Growth rates of power-free languages (Q1037095) (← links)
- (Q1272005) (redirect page) (← links)
- Syntactic semigroups of avoided languages (Q1272006) (← links)
- Binary avoidability and Thue-Morse words (Q1380288) (← links)
- Comparison of LZ77-type parsings (Q1621503) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Growth of power-free languages over large alphabets (Q1678750) (← links)
- Binary words avoided by the Thue-Morse sequence (Q1924519) (← links)
- More on quantum, stochastic, and pseudo stochastic languages with few states (Q2003453) (← links)
- Abelian repetition threshold revisited (Q2097234) (← links)
- Computing the maximum exponent in a stream (Q2118207) (← links)
- String periods in the order-preserving model (Q2288212) (← links)
- Tight tradeoffs for real-time approximation of longest palindromes in streams (Q2319637) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Lower bounds on words separation: are there short identities in transformation semigroups? (Q2401420) (← links)
- On the tree of binary cube-free words (Q2408811) (← links)
- Searching for Zimin patterns (Q2512657) (← links)
- On minimal critical exponent of balanced sequences (Q2672583) (← links)
- The structure of the set of cube-free $ Z$-words in a two-letter alphabet (Q2710702) (← links)
- On Pansiot Words Avoiding 3-Repetitions (Q2789523) (← links)
- Constructing Premaximal Binary Cube-free Words of Any Level (Q2789527) (← links)
- Fife's Theorem for (7/3)-Powers (Q2789528) (← links)
- Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words (Q2800416) (← links)
- Ternary Square-Free Partial Words with Many Wildcards (Q2817387) (← links)
- ON PANSIOT WORDS AVOIDING 3-REPETITIONS (Q2841970) (← links)
- CONSTRUCTING PREMAXIMAL BINARY CUBE-FREE WORDS OF ANY LEVEL (Q2841971) (← links)
- ON THE EXISTENCE OF MINIMAL β-POWERS (Q2909104) (← links)
- On Abelian repetition threshold (Q2911433) (← links)
- Constructing Premaximal Ternary Square-Free Words of Any Level (Q2912773) (← links)
- On Two Stronger Versions of Dejean’s Conjecture (Q2912779) (← links)
- Binary patterns in binary cube-free words: Avoidability and growth (Q2934274) (← links)
- Periodic Partial Words and Random Bipartite Graphs (Q2934871) (← links)
- Quantum, Stochastic, and Pseudo Stochastic Languages with Few States (Q2945548) (← links)
- Two Combinatorial Criteria for BWT Images (Q3007642) (← links)
- ALMOST OVERLAP-FREE WORDS AND THE WORD PROBLEM FOR THE FREE BURNSIDE SEMIGROUP SATISFYING x<sup>2</sup>= x<sup>3</sup> (Q3097925) (← links)
- (Q3115555) (← links)
- String Periods in the Order-Preserving Model (Q3304137) (← links)
- RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES (Q3444851) (← links)
- On the Tree of Ternary Square-Free Words (Q3449372) (← links)
- (Q3450102) (← links)
- Combinatorial Complexity of Regular Languages (Q3503647) (← links)
