Pages that link to "Item:Q444679"
From MaRDI portal
The following pages link to Deciding context equivalence of binary overlap-free words in linear time (Q444679):
Displaying 8 items.
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Lengths of irreducible and delicate words (Q2153402) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Linear-Time Sequence Comparison Using Minimal Absent Words & Applications (Q2802951) (← links)
- On the Tree of Ternary Square-Free Words (Q3449372) (← links)
- A linear-time algorithm to decide whether a binary word contains an overlap (Q3789095) (← links)
- Transition property for cube-free words (Q5918354) (← links)
- Computing the \(k\)-binomial complexity of the Thue-Morse word (Q5918904) (← links)