The following pages link to (Q3951572):
Displaying 15 items.
- An infinite square-free co-CFL (Q761044) (← links)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- An efficient algorithm for online square detection (Q860815) (← links)
- Efficient on-line repetition detection (Q955034) (← links)
- The interchange or pump (di)lemmas for context-free languages (Q1104760) (← links)
- On the generation of powers by OS schemes (Q1116709) (← links)
- An optimal algorithm for computing the repetitions in a word (Q1155963) (← links)
- Sharp characterizations of squarefree morphisms (Q1162827) (← links)
- Permutations are not context-free: An application of the interchange lemma (Q1165021) (← links)
- On the language of primitive words (Q1351946) (← links)
- Uniformly bounded duplication languages (Q1763482) (← links)
- Most pseudo-copy languages are not context-free (Q2695285) (← links)
- Uniformly bounded duplication codes (Q3512596) (← links)
- Duplication in DNA Sequences (Q3533029) (← links)
- (Q5061518) (← links)
