The following pages link to (Q4412125):
Displaying 22 items.
- Pattern avoidance: themes and variations (Q557911) (← links)
- On ternary square-free circular words (Q612919) (← links)
- Words avoiding a reflexive acyclic relation (Q813446) (← links)
- Languages generated by iterated idempotency (Q868949) (← links)
- Pattern avoidance on graphs (Q878624) (← links)
- On periodic properties of circular words (Q897316) (← links)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Syntactic semigroups of avoided languages (Q1272006) (← links)
- Avoidability of circular formulas (Q1743715) (← links)
- On cyclic strings avoiding a pattern (Q1744751) (← links)
- The Thue-Morse word contains circular \(5/2^+\) power free words of every length (Q1770411) (← links)
- Non-repetitive colorings of infinite sets (Q1874373) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101 (Q2216428) (← links)
- Breaking the rhythm on graphs (Q2476277) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- On the existence of minimal \(\beta\)-powers (Q2909104) (← links)
- (Q4994949) (← links)
- Nearest constrained circular words (Q5140768) (← links)
- Distinct Squares in Circular Words (Q5150916) (← links)
- Counting subwords in circular words and their Parikh matrices (Q6185846) (← links)