{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:23:51Z","timestamp":1725459831763},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354017219X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039606","type":"book-chapter","created":{"date-parts":[[2006,1,31]],"date-time":"2006-01-31T11:55:52Z","timestamp":1138708552000},"page":"189-197","source":"Crossref","is-referenced-by-count":0,"title":["Avoidable patterns on 2 letters"],"prefix":"10.1007","author":[{"given":"Ursula","family":"Schmidt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","volume":"85","author":"D. R. Bean","year":"1979","unstructured":"Bean D. R., Ehrenfeucht A., McNulty G. F.: Avoidable Patterns in Strings of Symbols. Pacific J. Math. 85, 261\u2013294 (1979)","journal-title":"Pacific J. Math."},{"key":"16_CR2","first-page":"16","volume":"71","author":"J. Berstel","year":"1979","unstructured":"Berstel J. Sur les mots sans carr\u00e9 d\u00e9finis par un morphisme. Proc. of the Intern. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 71, pp. 16\u201325, Springer 1979","journal-title":"Proc. of the Intern. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science"},{"key":"16_CR3","unstructured":"Berstel J.: Mots de Fibonacci. S\u00e9minaire d'Informatique Th\u00e9orique 1980\u201381, Rapport LITP, Paris"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/3-540-12920-0_2","volume":"166","author":"J. Berstel","year":"1984","unstructured":"Berstel J.: Some recent results on square-free words. STACS 84, Lecture Notes in Computer Science, Vol. 166, pp. 14\u201325, Berlin-Heidelberg-New York: Springer 1984","journal-title":"Lecture Notes in Computer Science"},{"key":"16_CR5","unstructured":"Crochemore M.: R\u00e9gularit\u00e9s \u00e9vitables. Th\u00e8se d'Etat, Rapport LITP 83\u201343, Paris, 1983"},{"key":"16_CR6","unstructured":"Lothaire: Combinatorics on Words. Addison-Wesley 1984"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"M. G. Main","year":"1984","unstructured":"Main M. G., Lorentz R. J.: An O(n log n) Algorithm for Finding All Repetitions in a String. J. Algorithms 5, 422\u2013432 (1984)","journal-title":"J. Algorithms"},{"key":"16_CR8","first-page":"49","volume":"21","author":"A. Restivo","year":"1983","unstructured":"Restivo A., Salemi S.: On Weakly Square-free Words. Bull. EATCS 21, 49\u201356 (1983)","journal-title":"Bull. EATCS"},{"key":"16_CR9","unstructured":"Schmidt U.: Motifs in\u00e9vitables dans les mots. Th\u00e8se de l`Universit\u00e9 Pierre et Marie Curie (Paris 6), Rapport LITP, Paris, 1986"},{"key":"16_CR10","unstructured":"S\u00e9ebold P.: Propri\u00e9t\u00e9s combinatoires des mots infinis engendr\u00e9s par certains morphismes."},{"key":"16_CR11","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue A.: \u00dcber unendliche Zeichenreihen. Norske Vid. Selsk. Skr., I. Mat. Nat. Kl., Christiania, 7, 1\u201322 (1906)","journal-title":"Norske Vid. Selsk. Skr., I. Mat. Nat. Kl., Christiania"},{"key":"16_CR12","first-page":"1","volume":"1","author":"A. Thue","year":"1912","unstructured":"Thue A. \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr., I. Mat. Nat. Kl., Christiania, 1, 1\u201367 (1912)","journal-title":"Norske Vid. Selsk. Skr., I. Mat. Nat. Kl., Christiania"}],"container-title":["Lecture Notes in Computer Science","STACS 87"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039606.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T17:25:48Z","timestamp":1607534748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039606"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354017219X"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0039606","relation":{},"subject":[]}}