Pages that link to "Item:Q1261466"

The following pages link to Overlap-free words and finite automata (Q1261466):

Displaying 19 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)
• On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879) (← links)
• Overlap-free words and spectra of matrices (Q837157) (← links)
• On the context-freeness of the set of words containing overlaps (Q845966) (← links)
• Overlap-freeness in infinite partial words (Q1006076) (← links)
• On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) (Q2271420) (← links)
• Growth of repetition-free words -- a review (Q2484440) (← links)
• Optimal bounds for the similarity density of the Thue-Morse word with overlap-free and \(\frac73\)-power-free infinite binary words (Q2800416) (← links)
• Overlap-Free Regular Languages (Q3591303) (← links)
• (Q3689370) (← links)
• A linear-time algorithm to decide whether a binary word contains an overlap (Q3789095) (← links)
• On approximations of words by words without self-overlapping (Q3970810) (← links)
• OVERLAP-FREE WORDS AND THUE-MORSE SEQUENCES (Q4894097) (← links)
• Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices (Q5458519) (← links)
• Transition property for cube-free words (Q5918354) (← links)
• The Overlap Gap Between Left-Infinite and Right-Infinite Words (Q6114855) (← links)
• The first-order theory of binary overlap-free words is decidable (Q6622783) (← links)