The following pages link to (Q3395963):
Displaying 34 items.
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- On the maximal sum of exponents of runs in a string (Q450542) (← links)
- Computing the number of cubic runs in standard Sturmian words (Q496558) (← links)
- Relations on words (Q505060) (← links)
- On a conjecture about finite fixed points of morphisms (Q557920) (← links)
- The structure of subword graphs and suffix trees of Fibonacci words (Q860864) (← links)
- Nonrepetitive colorings of trees (Q864157) (← links)
- On the membership of invertible diagonal and scalar matrices (Q870838) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- On a word avoiding near repeats (Q989452) (← links)
- Growth rates of power-free languages (Q1037095) (← links)
- Growth of power-free languages over large alphabets (Q1678750) (← links)
- The maximal number of cubic runs in a word (Q1757839) (← links)
- On the maximum number of cubic subwords in a word (Q1761496) (← links)
- Non-Sturmian sequences of matrices providing the maximum growth rate of matrix products (Q2081841) (← links)
- Spectral concepts in genome informational analysis (Q2243578) (← links)
- Compressed string-matching in standard Sturmian words (Q2271418) (← links)
- On Dejean's conjecture over large alphabets (Q2456366) (← links)
- Connections between subwords and certain matrix mappings (Q2484434) (← links)
- Fractional parts of powers and Sturmian words (Q2487990) (← links)
- Periods in extensions of words (Q2509152) (← links)
- Properties of a class of Toeplitz words (Q2672565) (← links)
- On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
- Asymptotic Subword Complexity (Q3166955) (← links)
- Some Algebraic Properties of Machine Poset of Infinite Words (Q3526411) (← links)
- Two-Sided Bounds for the Growth Rates of Power-Free Languages (Q3637248) (← links)
- Word-Representable Graphs: a Survey (Q4558287) (← links)
- General Framework (Q4613545) (← links)
- (Q5009608) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q5041252) (← links)
- Reconstructing Words from Right-Bounded-Block Words (Q6169894) (← links)
- A robust version of Hegedűs's lemma, with applications (Q6566590) (← links)
