The DOI matches its Crossref record.
Extremal Infinite Overlap-Free Binary Words
Abstract
Let $\overline{\bf t}$ be the infinite fixed point, starting with $1$, of the morphism $\mu: 0 \rightarrow 01$, $1 \rightarrow 10$. An infinite word over $\lbrace 0, 1 \rbrace$ is said to be overlap-free if it contains no factor of the form $axaxa$, where $a \in \lbrace 0,1 \rbrace$ and $x \in \lbrace 0,1 \rbrace^*$. We prove that the lexicographically least infinite overlap-free binary word beginning with any specified prefix, if it exists, has a suffix which is a suffix of $\overline{\bf t}$. In particular, the lexicographically least infinite overlap-free binary word is $001001 \overline{\bf t}$.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Allouche, Currie, and Shallit [2] showed that the lexicographically least overlap-free word on { 0 , 1 } with a fixed prefix, if it exists, always has a suffix that is a suffix of 10010110 · · · (the complement of the Thue-Morse word).”
From The Lexicographically Least Square-Free Word with a Given Prefix (2023) · cites this paper as [2]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Avoiding Fractional Powers over the Natural Numbers
Pudwell, L., & Rowland, E. (2018) · The Electronic Journal of Combinatorics · doi:10.37236/6678 · Cited by 4
Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers
Rowland, E., & Stipulanti, M. (2020) · The Electronic Journal of Combinatorics · doi:10.37236/9581 · Cited by 3
The Lexicographically Least Square-Free Word with a Given Prefix
Berera, S., Gómez-Colunga, A., Lakerdas-Gayle, J., López, J., Matin, M., Roebuck, D., Rowland, E., Scully, N., & Whidden, J. (2023) · The Electronic Journal of Combinatorics · doi:10.37236/11659
Metadata
- Authors
- Allouche, J.-P., Currie, J., & Shallit, J.
- Venue
- The Electronic Journal of Combinatorics
- Published
- 1998-05-03
- Volume
- 5
- Issue
- 1
- ISSN
- 1077-8926
- Cited by
- 17
- References
- 0
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Extremal Infinite Overlap-Free Binary Words. https://app.cochat.ai/papers/10.37236/1365
- The paper
- Allouche, J.-P., Currie, J., & Shallit, J. (1998). Extremal Infinite Overlap-Free Binary Words. The Electronic Journal of Combinatorics. https://doi.org/10.37236/1365
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.