Pages that link to "Item:Q3789095"
From MaRDI portal
The following pages link to A linear-time algorithm to decide whether a binary word contains an overlap (Q3789095):
Displaying 10 items.
- Deciding context equivalence of binary overlap-free words in linear time (Q444679) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- Polynomial versus exponential growth in repetition-free binary words (Q598459) (← links)
- Overlap-free words and spectra of matrices (Q837157) (← links)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Overlap-free words and finite automata (Q1261466) (← links)
- On repetition-free binary words of minimal density (Q1292490) (← links)
- On the number of Abelian square-free words on four letters (Q1382260) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- Infinite words containing squares at every position (Q5190080) (← links)
