Pages that link to "Item:Q496049"
From MaRDI portal
The following pages link to Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049):
Displaying 27 items.
- Relations on words (Q505060) (← links)
- Weighted prefix normal words: mind the gap (Q832931) (← links)
- On the additive complexity of a Thue-Morse-like sequence (Q1741501) (← links)
- On the Lie complexity of Sturmian words (Q2089692) (← links)
- Equations over the \(k\)-binomial monoids (Q2140471) (← links)
- Binomial complexities and Parikh-collinear morphisms (Q2164005) (← links)
- A compactness property of the \(k\)-abelian monoids (Q2192368) (← links)
- Avoiding abelian powers cyclically (Q2221763) (← links)
- Absent subsequences in words (Q2695493) (← links)
- On $k$-abelian equivalence and generalized Lagrange spectra (Q3298856) (← links)
- The binomial equivalence classes of finite words (Q4970534) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q5041252) (← links)
- (Q5089254) (← links)
- GAPS IN THE THUE–MORSE WORD (Q5870872) (← 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)
- Absent Subsequences in Words (Q6070611) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- On the number of distinct \(k\)-decks: enumeration and bounds (Q6112289) (← links)
- Longest Common Subsequence with Gap Constraints (Q6134862) (← links)
- Automaticity and Parikh-Collinear Morphisms (Q6134878) (← links)
- On the 2-binomial complexity of the generalized Thue-Morse words (Q6138835) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q6169894) (← links)
- Subsequences in bounded ranges: matching and analysis problems (Q6173109) (← links)
- (Q6190431) (← links)
- Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)