{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T19:29:28Z","timestamp":1655407768345},"reference-count":11,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1984]]},"DOI":"10.1051\/ita\/1984180201471","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T10:30:56Z","timestamp":1486377056000},"page":"147-159","source":"Crossref","is-referenced-by-count":7,"title":["On context constrained squares and repetitions in a string"],"prefix":"10.1051","volume":"18","author":[{"given":"A.","family":"Apostolico","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. THUE A., Uber Die Gegenseitige Lage Gleicher Teile Gewisser Zeichenreichen, Skr. Vid.-Kristiana I. Mat. Naturv. Klasse, Vol. 1, 1912, pp. 1-6744.0462.01"},{"key":"R2","unstructured":"2. MAIN M. and LORENTZ R., An O (n log n) Algorithm for Finding Repetition in a String. T.R. 79-056, Comp. Sc. Dept., Washington State Univ., Pullman, 1972."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. CROCHEMORE M., An Optimal Algorithm for Computing the Repetitions in a Word, Information Processing Letters, Vol. 12, 1981, pp. 244-250.6328730467.68075","DOI":"10.1016\/0020-0190(81)90024-7"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. APOSTOLICO A. and PREPARATA F. P., Optimal Off-Line Detection of Repetitions in a String, Theoretical Computer Science, Vol. 22, 1983, pp. 237-315.6930620497.68052","DOI":"10.1016\/0304-3975(83)90109-3"},{"key":"R5","unstructured":"5. LENTIN A. and SCHUTZEMBERGER M. P., A Combinatorial Problem in the Theory of Free Monoids, in Combinatorial Mathematics and its Applications, University of North Carolina Press, N.C., 1969, pp. 128-144.0221.20076"},{"key":"R6","unstructured":"6. APOSTOLICO A. and PREPARATA F. P., A Structure for the Statistics of All Substrings of a Textstring With or Without Overlap. Proceedings of the 2nd World Conference on Mathematics at the Service of Man, Las Palmas (Canary Islands), 1982.0503.68064"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. MCCREIGHT E. M., A Space Economical Suffix Tree Construction Algorithm, J. of the ACM, Vol. 23, 1976, pp. 262-272.4135940329.68042","DOI":"10.1145\/321941.321946"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. LYNDON R. C. and SCHUTZEMBERGER M. P., The Equation aM = bN cP in a Free Group, Michigan Mathemat. Journal, Vol. 9, 1962, pp. 289-2981628380106.02204","DOI":"10.1307\/mmj\/1028998766"},{"key":"R9","unstructured":"9. AHO A. V., HOPCROFT J. E. and ULLMAN J. D., The Design and Analysis of Computer Algorithms, Addison-Wesley, MA, 1974.4135920326.68005"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. WEINER P., Linear Pattern Matching Algorithms, Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973, pp. 1-11441032","DOI":"10.1109\/SWAT.1973.13"},{"key":"R11","unstructured":"11. KNUTH D. E., The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, MA, 1973.0302.68010445948"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1984180201471\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:32:59Z","timestamp":1568784779000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1984180201471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":11,"journal-issue":{"issue":"2"},"alternative-id":["ita1984180201471"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1984180201471","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}