The following pages link to (Q3704906):
Displaying 14 items.
- A powerful abelian square-free substitution over 4 letters (Q837181) (← links)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Non-repetitive words relative to a rewriting system (Q908710) (← links)
- Multidimensional unrepetitive configurations (Q1106022) (← links)
- Iterated GSMs and CO-CFL (Q1112624) (← links)
- Avoidable patterns on two letters (Q1114419) (← links)
- Overlap-free words and finite automata (Q1261466) (← links)
- Counting ternary square-free words quickly (Q2140467) (← links)
- Exponential lower bounds for the number of words of uniform length avoiding a pattern (Q2381499) (← links)
- A linear-time algorithm to decide whether a binary word contains an overlap (Q3789095) (← links)
- Algèbres effectives dans la programmation logique avec contraintes (Q4012670) (← links)
- On the power of periodic iteration of morphisms (Q4630286) (← links)
- Abelian squares are avoidable on 4 letters (Q5204304) (← links)
- Partially abelian squarefree words (Q5751950) (← links)
