Linear Time Recognition of Squarefree Strings
- 1 January 1985
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An O(n log n) algorithm for finding all repetitions in a stringJournal of Algorithms, 1984
- Optimal off-line detection of repetitions in a stringTheoretical Computer Science, 1983
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981
- Mots sans carre et morphismes iteresDiscrete Mathematics, 1980
- Avoidable patterns in strings of symbolsPacific Journal of Mathematics, 1979
- Sur les mots sans carré définis par un morphismeLecture Notes in Computer Science, 1979
- Non-repetitive sequencesMathematical Proceedings of the Cambridge Philosophical Society, 1970
- 5030The American Mathematical Monthly, 1963
- Wiederholungsfreie FolgenZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1958
- Unending chess, symbolic dynamics and a problem in semigroupsDuke Mathematical Journal, 1944