Pages that link to "Item:Q388738"
From MaRDI portal
The following pages link to On a generalization of abelian equivalence and complexity of infinite words (Q388738):
Displaying 37 items.
- \(k\)-abelian pattern matching (Q491150) (← links)
- On some generalizations of abelian power avoidability (Q496047) (← links)
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- On the 2-abelian complexity of the Thue-Morse word (Q501000) (← links)
- Relations on words (Q505060) (← links)
- On cardinalities of \(k\)-abelian equivalence classes (Q728280) (← links)
- On the \(k\)-abelian complexity of the Cantor sequence (Q1689047) (← links)
- On the additive complexity of a Thue-Morse-like sequence (Q1741501) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- On the 2-abelian complexity of generalized Cantor sequences (Q2087468) (← links)
- On the Lie complexity of Sturmian words (Q2089692) (← links)
- Binomial complexities and Parikh-collinear morphisms (Q2164005) (← links)
- Abelian periods of factors of Sturmian words (Q2187128) (← links)
- A compactness property of the \(k\)-abelian monoids (Q2192368) (← links)
- Avoiding abelian powers cyclically (Q2221763) (← links)
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences (Q2256124) (← links)
- Avoiding 2-binomial squares and cubes (Q2257294) (← links)
- On abelian saturated infinite words (Q2326392) (← links)
- On growth and fluctuation of \(k\)-abelian complexity (Q2400973) (← links)
- Lower bounds on words separation: are there short identities in transformation semigroups? (Q2401420) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- k-Abelian Equivalence and Rationality (Q2817377) (← links)
- Cyclic Complexity of Words (Q2922011) (← links)
- On Growth and Fluctuation of k-Abelian Complexity (Q3194711) (← links)
- On $k$-abelian equivalence and generalized Lagrange spectra (Q3298856) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$ (Q4685343) (← links)
- The binomial equivalence classes of finite words (Q4970534) (← links)
- (Q5089254) (← links)
- Reverse-Safe Text Indexing (Q5102053) (← links)
- Separating the Words of a Language by Counting Factors (Q5158654) (← links)
- Avoidability of long 𝑘-abelian repetitions (Q5741503) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)
- Templates for the \(k\)-binomial complexity of the Tribonacci word (Q5919292) (← 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)
