Pages that link to "Item:Q3016224"
From MaRDI portal
The following pages link to AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (Q3016224):
Displaying 34 items.
- Abelian powers and repetitions in Sturmian words (Q287434) (← links)
- Fast algorithms for abelian periods in words and greatest common divisor queries (Q340577) (← links)
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Fixed points avoiding abelian \(k\)-powers (Q412180) (← links)
- On some generalizations of abelian power avoidability (Q496047) (← links)
- On the 2-abelian complexity of the Thue-Morse word (Q501000) (← links)
- Weak abelian periodicity of infinite words (Q504987) (← links)
- Relations on words (Q505060) (← links)
- Recurrent words with constant abelian complexity (Q544139) (← links)
- On Abelian squares and substitutions (Q1292481) (← links)
- On abelian subshifts (Q1622994) (← links)
- Abelian antipowers in infinite words (Q2002043) (← links)
- On the Lie complexity of Sturmian words (Q2089692) (← links)
- Binomial complexities and Parikh-collinear morphisms (Q2164005) (← links)
- Avoiding abelian powers cyclically (Q2221763) (← links)
- Abelian closures of infinite binary words (Q2237936) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- On abelian saturated infinite words (Q2326392) (← links)
- Aperiodic two-dimensional words of small abelian complexity (Q2327230) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Abelian complexity and frequencies of letters in infinite words (Q2833546) (← links)
- On abelian versions of critical factorization theorem (Q2911422) (← links)
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS (Q3022001) (← links)
- Abelian complexity of minimal subshifts (Q3074533) (← links)
- Avoiding Three Consecutive Blocks of the Same Size and Same Sum (Q3189645) (← links)
- IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS (Q4923285) (← links)
- Abelian Repetitions in Sturmian Words (Q5300843) (← links)
- Templates for the \(k\)-binomial complexity of the Tribonacci word (Q5919292) (← links)
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group (Q6097068) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- On the 2-binomial complexity of the generalized Thue-Morse words (Q6138835) (← links)
- Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)
- Automatic abelian complexities of Parikh-collinear fixed points (Q6661763) (← links)
