Avoiding large squares in infinite binary words
From MaRDI portal
Publication:557912
DOI10.1016/j.tcs.2005.01.005zbMath1099.68080arXivmath/0306081OpenAlexW2086666778MaRDI QIDQ557912
Narad Rampersad, Wang, Ming-wei, Jeffrey O. Shallit
Publication date: 30 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0306081
Related Items (19)
On the aperiodic avoidability of binary patterns with variables and reversals ⋮ Clusters of repetition roots: single chains ⋮ Avoiding letter patterns in ternary square-free words ⋮ Fewest repetitions in infinite binary words ⋮ Infinite words containing the minimal number of repetitions ⋮ Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101 ⋮ Fewest repetitions versus maximal-exponent powers in infinite binary words ⋮ Square-free shuffles of words ⋮ A low-complexity LUT-based squaring algorithm ⋮ Avoiding large squares in partial words ⋮ Hairpin structures defined by DNA trajectories ⋮ On the number of frames in binary words ⋮ A generalization of Thue freeness for partial words ⋮ Cyclically repetition-free words on small alphabets ⋮ INNER PALINDROMIC CLOSURE ⋮ A generator of morphisms for infinite words ⋮ Efficient big integer multiplication and squaring algorithms for cryptographic applications ⋮ Infinite binary words containing repetitions of odd period ⋮ The simplest binary word with only three squares
Cites Work
- Unnamed Item
- Polynomial versus exponential growth in repetition-free binary words
- Infinite 0-1 sequences without long adjacent identical blocks
- On repetitions of blocks in binary sequences
- How many squares must a binary sequence contain?
- On nonrepetitive sequences
- Automatic Sequences
- The Goulden—Jackson cluster method: extensions, applications and implementations
This page was built for publication: Avoiding large squares in infinite binary words
