Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 21

The DOI matches its Crossref record.

Linear Time Recognition of Squarefree Strings

Main, Michael G., Lorentz, Richard J.·1985·Combinatorial Algorithms on Words
DOI 10.1007/978-3-642-82456-2_18
Open this paper in CoChat — free account

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-3-642-82456-2_18

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Cites

No references could be resolved yet.

Research works printed but not linked: 18

  1. A. Apostolico and F.P. Preparata, Optimal off-line detection of repetitions in a string, TCS 22 (1983) 297–315. · doi:10.1016/0304-3975(83)90109-3
  2. S.E. Arshon, Dokazatel’stov suscestvovanija n-znacnyh beskonecnyh asim-metricnyh posledovatel’nostei, Mat. Sb. 44 (1937), 769–779.
  3. D.R. Bean, A. Ehrenfeucht and G.F. McNulty, Avoidable patterns in strings of symbols, Pacific J. Math., 85 (1979), 261–294. · doi:10.2140/pjm.1979.85.261
  4. J. Berstel, Sur les mots sans carre definis par un morphisme, in Automata, Languages and Programming (A. Maurer, Ed.), LNCS 71, Springer-Verlag, Berlin, 1979, 16–25. · doi:10.1007/3-540-09510-1_2
  5. J. Berstel, Mots sans carre et morphismes iters, Discrete Math. 29 (1979), 235–244. · doi:10.1016/0012-365x(80)90151-x
  6. C.H. Braunholtz, Solution to problem 5030, Am. Math. Mo. 70 (1963), 675–676. · doi:10.2307/2311652
  7. M. Crochemore, Determination optimale des repetitions dans un mot, Technical Report 80–53, Laboratoire Informatique Theorique et Programmation, University of Paris (1981).
  8. M. Crochemore, An optimal algorithm for computing repetitions in a word, IPL 12 (1981), 244–250. · DOI
  9. A.A. Evdokimov, Strongly asymmetric sequences generated by a finite number of symbols, Soviet Math. Dokl., 9 (1968), 536–539.
  10. D. Hawkins and W.E. Mientka, On sequences which contain no repetitions, Math. Student 24 (1956), 185–187. MR 19 (1958) #241.
  11. G.A. Hedlund, Remarks on the work of Axel Thue on sequences, Nord. Mat. Tidskr. 16 (1967), 148–150. MR 37 (1959), #4454.
  12. M.G. Main and R.J. Lorentz, An 0(n logn) algorithm for finding all repetitions in a string, J. of Algorithms, to appear (1984). · doi:10.1016/0196-6774(84)90021-x
  13. M. Morse, A solution of the problem of infinite play in chess, Bull. Amer. Math. Soc., 44 (1938), 632.
  14. M. Morse and G.A. Hedlund, Unending chess, symbolic dynamics and a problem in semigroups, Duke Math. J. 11 (1944), 1–7. MR 5 (1944) #202. · doi:10.1215/s0012-7094-44-01101-4
  15. P.A.B. Pleasants, Nonrepetitive sequences, Proc. Cambridge Phil. Soc. 68 (1970), 267–274. · doi:10.1017/s0305004100046077
  16. A. Thue, Uber unendliche Zeichenreihen. Norske Wdenskabers Selskabs Skrifter Mat.-Nat. Kl. (Kristiania) (1906), Nr. 7, 1–22.
  17. A. Thue, Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norske Vlcienskabers Selskabs Skrifter Mat.-Nat. Kl. (Kristiania) (1912), Nr. 1, 1–67.
  18. T. Zech, Wiederholungsfreie Folgen, Z. Angew. Math. Mech. 38 (1958), 206–209. · doi:10.1002/zamm.19580380510

Cited by

See all 21

Metadata

Authors
Main, M. G., & Lorentz, R. J.
Venue
Combinatorial Algorithms on Words
Publisher
Springer Berlin Heidelberg
Published
1985
Pages
271-278
DOI
10.1007/978-3-642-82456-2_18
Cited by
21
References
0
Language
en
Licence
www.springer.com/tdm (tdm)

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: Linear Time Recognition of Squarefree Strings. https://app.cochat.ai/papers/10.1007/978-3-642-82456-2_18
The paper
Main, M. G., & Lorentz, R. J. (1985). Linear Time Recognition of Squarefree Strings. Combinatorial Algorithms on Words. https://doi.org/10.1007/978-3-642-82456-2_18

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.