{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T07:20:30Z","timestamp":1773213630669,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8690,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0166-218x(89)90051-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"145-153","source":"Crossref","is-referenced-by-count":82,"title":["Detecting leftmost maximal periodicities"],"prefix":"10.1016","volume":"25","author":[{"given":"Michael G.","family":"Main","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(89)90051-6_BIB1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","article-title":"Optimal off-line detection of repetitions in a string","volume":"22","author":"Apostolico","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(89)90051-6_BIB2","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"89","article-title":"Very small families of algebraic nonrational languages","author":"Autebert","year":"1980"},{"key":"10.1016\/0166-218X(89)90051-6_BIB3","doi-asserted-by":"crossref","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","article-title":"Avoidable patterns in strings of symbols","volume":"85","author":"Bean","year":"1979","journal-title":"Pacific J. Math."},{"key":"10.1016\/0166-218X(89)90051-6_BIB4","series-title":"Automata, Languages and Programming","first-page":"16","article-title":"Sur les mots sans carre definis par un morphisme","volume":"71","author":"Berstel","year":"1979"},{"issue":"1","key":"10.1016\/0166-218X(89)90051-6_BIB5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(86)90034-7","article-title":"Every iterated morphism yields a co-CFL","volume":"22","author":"Berstel","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(89)90051-6_BIB6","series-title":"Combinatorics on Words","article-title":"Square-free words and idempotent semigroups","author":"Berstel","year":"1983"},{"key":"10.1016\/0166-218X(89)90051-6_BIB7","series-title":"Tech. Rep. 80-53","article-title":"Determination optimale des repetitions dans un mot","author":"Crochemore","year":"1981"},{"key":"10.1016\/0166-218X(89)90051-6_BIB8","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","article-title":"An optimal algorithm for computing repetitions in a word","volume":"12","author":"Crochemore","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(89)90051-6_BIB9_1","article-title":"Linear searching for a square in a word","volume":"F12","author":"Crochemore","year":"1984"},{"key":"10.1016\/0166-218X(89)90051-6_BIB9_2","first-page":"66","volume":"24","year":"1984","journal-title":"Bull. EATCS"},{"key":"10.1016\/0166-218X(89)90051-6_BIB10","first-page":"262","article-title":"Problem 135","volume":"30","author":"Crochemore","year":"1986","journal-title":"Bull. EATCS"},{"key":"10.1016\/0166-218X(89)90051-6_BIB11","article-title":"Conditions enforcing regularity of context-free languages","author":"Ehrenfeucht","year":"1982","journal-title":"University of Colorado Tech. Rep. CU-CS-223-82"},{"key":"10.1016\/0166-218X(89)90051-6_BIB12","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/322047.322056","article-title":"A linear-time on-line recognition for palstar","volume":"25","author":"Galil","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(89)90051-6_BIB13","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/S0022-0000(76)80010-4","article-title":"Bounded AFLS","volume":"12","author":"Goldstine","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(89)90051-6_BIB14_1","first-page":"148","article-title":"Remarks on the work of Axel Thue on sequences","volume":"16","author":"Hedlund","year":"1967","journal-title":"Nordisk. Mat. Tidskr."},{"key":"10.1016\/0166-218X(89)90051-6_BIB14_2","first-page":"4454","volume":"37","year":"1959","journal-title":"MR"},{"key":"10.1016\/0166-218X(89)90051-6_BIB15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(89)90051-6_BIB16","series-title":"Proceedings ICALP-85","first-page":"404","article-title":"Applications of an infinite squarefree co-CFL","author":"Main","year":"1985"},{"key":"10.1016\/0166-218X(89)90051-6_BIB17","article-title":"An O(n log n) algorithm for recognizing repetition","author":"Main","year":"1979","journal-title":"Washington State University Tech. Rep. CS-79-056"},{"key":"10.1016\/0166-218X(89)90051-6_BIB18","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","article-title":"An O(n log n) algorithm for finding all repetitions in a string","volume":"5","author":"Main","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(89)90051-6_BIB19","series-title":"Proceedings NATO Advanced Research Workshop on Combinatorial Algorithms on Words","article-title":"Linear time recognition of square-free strings","author":"Main","year":"1984"},{"key":"10.1016\/0166-218X(89)90051-6_BIB20","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1145\/321892.321896","article-title":"A new linear-time on-line algorithm for finding the smallest initial palindrom of a string","volume":"22","author":"Manacher","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(89)90051-6_BIB21","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","article-title":"A space-economial suffix tree construction algorithm","volume":"23","author":"McCreight","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(89)90051-6_BIB22","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0214031","article-title":"An \u201cInterchange Lemma\u201d for context-free languages","volume":"14","author":"Ogden","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(89)90051-6_BIB23","first-page":"175","article-title":"A new characterization of the regular languages","volume":"115","author":"Reutenauer","year":"1981"},{"key":"10.1016\/0166-218X(89)90051-6_BIB24","series-title":"Jewels of Formal Language Theory","author":"Saloma","year":"1981"},{"key":"10.1016\/0166-218X(89)90051-6_BIB25","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01768472","article-title":"Real-time recognition of substring repetition and reversal","volume":"11","author":"Seiferas","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0166-218X(89)90051-6_BIB26","first-page":"62","article-title":"Detection of periodicities and string-matching in real time","volume":"105","author":"Slisenko","year":"1981","journal-title":"Zap. Nauchn Sem. Leningrad. Otdel. Mat. Inst. Steklov."},{"key":"10.1016\/0166-218X(89)90051-6_BIB27_1","first-page":"7","article-title":"Uber unendlich Zeichenreihen","author":"Thue","year":"1906","journal-title":"Norske Vid. Selsk. Skr. Mat.-Nat. Kl. (Kristiania)"},{"key":"10.1016\/0166-218X(89)90051-6_BIB27_2","first-page":"1","article-title":"Uber unendlich Zeichenreihen","author":"Thue","year":"1906","journal-title":"Norske Vid. Selsk. Skr. Mat.-Nat. Kl. (Kristiania)"},{"key":"10.1016\/0166-218X(89)90051-6_BIB28_1","first-page":"1","article-title":"Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen","author":"Thue","year":"1912","journal-title":"Norske Vid. Selsk. Skr. Mat.-Nat. Kl. (Kristiania)"},{"key":"10.1016\/0166-218X(89)90051-6_BIB28_2","first-page":"1","article-title":"Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen","author":"Thue","year":"1912","journal-title":"Norske Vid. Selsk. Skr. Mat.-Nat. Kl. (Kristiania)"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X89900516?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X89900516?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:50:39Z","timestamp":1555116639000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X89900516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":32,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0166218X89900516"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(89)90051-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}