{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:02:42Z","timestamp":1743130962528,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030850876"},{"type":"electronic","value":"9783030850883"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85088-3_13","type":"book-chapter","created":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:03:24Z","timestamp":1630883004000},"page":"153-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Doubled Patterns with Reversal Are 3-Avoidable"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Ochem","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2021.03.010","volume":"866","author":"J Currie","year":"2021","unstructured":"Currie, J., Mol, L.: The undirected repetition threshold and undirected pattern avoidance. Theor. Comput. Sci. 866, 56\u201369 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"13_CR2","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1142\/S0218196717500242","volume":"27","author":"J Currie","year":"2017","unstructured":"Currie, J., Mol, L., Rampersad, N.: A family of formulas with reversal of high avoidability index. Int. J. Algebra Comput. 27(5), 477\u2013493 (2017)","journal-title":"Int. J. Algebra Comput."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2018.04.039","volume":"738","author":"J Currie","year":"2018","unstructured":"Currie, J., Mol, L., Rampersad, N.: Avoidance bases for formulas with reversal. Theor. Comput. Sci. 738, 25\u201341 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1016\/j.ic.2007.02.004","volume":"205","author":"J Bell","year":"2007","unstructured":"Bell, J., Goh, T.L.: Exponential lower bounds for the number of words of uniform length avoiding a pattern. Inform. Comput. 205, 1295\u20131306 (2007)","journal-title":"Inform. Comput."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1051\/ita:2006020","volume":"40","author":"P Ochem","year":"2006","unstructured":"Ochem, P.: A generator of morphisms for infinite words. RAIRO Theoret. Inform. Appl. 40, 427\u2013441 (2006)","journal-title":"RAIRO Theoret. Inform. Appl."},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"#P1.19","DOI":"10.37236\/5618","volume":"23","author":"P Ochem","year":"2016","unstructured":"Ochem, P.: Doubled patterns are 3-avoidable. Electron. J. Comb. 23(1), #P1.19 (2016)","journal-title":"Electron. J. Comb."},{"key":"13_CR7","unstructured":"Ochem, P.: A family of formulas with reversal of arbitrarily high avoidability index. arXiv:2103.07693"},{"issue":"1","key":"13_CR8","doi-asserted-by":"publisher","first-page":"#P1.12","DOI":"10.37236\/7901","volume":"26","author":"P Ochem","year":"2019","unstructured":"Ochem, P.: Rosenfeld, M: On some interesting ternary formulas. Electron. J. Comb. 26(1), #P1.12 (2019)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"#P1.4","DOI":"10.37236\/9593","volume":"28","author":"P Ochem","year":"2021","unstructured":"Ochem, P., Rosenfeld, M.: Avoidability of palindrome patterns. Electron. J. Comb 28(1), #P1.4 (2021)","journal-title":"Electron. J. Comb"}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85088-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:04:13Z","timestamp":1630883053000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85088-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850876","9783030850883"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85088-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2021.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 invited papers are also included","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}