Overlap-free words and finite automata
From MaRDI portal
Publication:1261466
DOI10.1016/0304-3975(93)90118-DzbMath0784.68049MaRDI QIDQ1261466
Publication date: 16 September 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (11)
Overlap-free words and spectra of matrices ⋮ Polynomial versus exponential growth in repetition-free binary words ⋮ A rewriting of Fife's theorem about overlap-free words ⋮ Unnamed Item ⋮ On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters ⋮ Growth of repetition-free words -- a review ⋮ Pattern avoidance: themes and variations ⋮ On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) ⋮ Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words ⋮ Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices ⋮ Transition property for cube-free words
Cites Work
- On the centers of the set of weakly square-free words on a two letter alphabet
- Enumeration of irreducible binary words
- Unending chess, symbolic dynamics and a problem in semi-groups
- A linear-time algorithm to decide whether a binary word contains an overlap
- Binary Sequences which Contain no BBb
- On Relations Defined by Generalized Finite Automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Overlap-free words and finite automata
