{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:01Z","timestamp":1759638181209,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030199548"},{"type":"electronic","value":"9783030199555"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19955-5_27","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"311-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Transition Property for Cube-Free Words"],"prefix":"10.1007","author":[{"given":"Elena A.","family":"Petrova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arseny M.","family":"Shur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0020-0190(84)90082-6","volume":"19","author":"A Carpi","year":"1984","unstructured":"Carpi, A.: On the centers of the set of weakly square-free words on a two-letter alphabet. Inf. Process. Lett. 19, 187\u2013190 (1984)","journal-title":"Inf. Process. Lett."},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(93)90118-D","volume":"115","author":"A Carpi","year":"1993","unstructured":"Carpi, A.: Overlap-free words and finite automata. Theor. Comput. Sci. 115, 243\u2013260 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0195-6698(95)90051-9","volume":"16","author":"JD Currie","year":"1995","unstructured":"Currie, J.D.: On the structure and extendibility of $$k$$-power free words. Eur. J. Comb. 16, 111\u2013124 (1995)","journal-title":"Eur. J. Comb."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/S0195-6698(03)00044-1","volume":"24","author":"JD Currie","year":"2003","unstructured":"Currie, J.D., Shelton, R.O.: The set of $$k$$-power free words over $$\\sigma $$ is empty or perfect. Eur. J. Comb. 24, 573\u2013580 (2003)","journal-title":"Eur. J. Comb."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Am. Math. Soc. 16, 109\u2013114 (1965)","journal-title":"Proc. Am. Math. Soc."},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10208-012-9121-0","volume":"13","author":"N Guglielmi","year":"2013","unstructured":"Guglielmi, N., Protasov, V.: Exact computation of joint spectral characteristics of linear operators. Found. Comput. Math. 13, 37\u201397 (2013)","journal-title":"Found. Comput. Math."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"3670","DOI":"10.1016\/j.tcs.2009.04.022","volume":"410","author":"RM Jungers","year":"2009","unstructured":"Jungers, R.M., Protasov, V.Y., Blondel, V.D.: Overlap-free words and spectra of matrices. Theor. Comput. Sci. 410, 3670\u20133684 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcta.2003.12.004","volume":"104","author":"J Karhum\u00e4ki","year":"2004","unstructured":"Karhum\u00e4ki, J., Shallit, J.: Polynomial versus exponential growth in repetition-free binary words. J. Combin. Theory Ser. A 104, 335\u2013347 (2004)","journal-title":"J. Combin. Theory Ser. A"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"6507","DOI":"10.1016\/j.tcs.2011.08.006","volume":"412","author":"R Kolpakov","year":"2011","unstructured":"Kolpakov, R., Rao, M.: On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters. Theoret. Comput. Sci. 412, 6507\u20136516 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR10","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 Inf. Th\u00e9or. App. 40, 427\u2013441 (2006)","journal-title":"RAIRO Inf. Th\u00e9or. App."},{"issue":"8","key":"27_CR11","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.1142\/S0129054112400643","volume":"23","author":"EA Petrova","year":"2012","unstructured":"Petrova, E.A., Shur, A.M.: Constructing premaximal binary cube-free words of any level. Internat. J. Found. Comp. Sci. 23(8), 1595\u20131609 (2012)","journal-title":"Internat. J. Found. Comp. Sci."},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/978-3-642-32589-2_65","volume-title":"Mathematical Foundations of Computer Science 2012","author":"EA Petrova","year":"2012","unstructured":"Petrova, E.A., Shur, A.M.: Constructing premaximal ternary square-free words of any level. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 752\u2013763. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_65"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-23660-5_19","volume-title":"Combinatorics on Words","author":"EA Petrova","year":"2015","unstructured":"Petrova, E.A., Shur, A.M.: On the tree of ternary square-free words. In: Manea, F., Nowotka, D. (eds.) WORDS 2015. LNCS, vol. 9304, pp. 223\u2013236. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23660-5_19"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-319-62809-7_22","volume-title":"Developments in Language Theory","author":"EA Petrova","year":"2017","unstructured":"Petrova, E.A., Shur, A.M.: On the tree of binary cube-free words. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 296\u2013307. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62809-7_22"},{"key":"27_CR15","series-title":"NATO ASI Series","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-82456-2_20","volume-title":"Combinatorial Algorithms on Words","author":"A Restivo","year":"1985","unstructured":"Restivo, A., Salemi, S.: Some decision results on non-repetitive words. In: Apostolico, A., Galil, Z. (eds.) Combinatorial Algorithms on Words. NATO ASI Series, vol. F12, pp. 289\u2013295. Springer-Verlag, Heidelberg (1985)"},{"key":"27_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.09.010","author":"J Shallit","year":"2018","unstructured":"Shallit, J., Shur, A.: Subword complexity and pattern avoidance. Theor. Comput. Sci. (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.09.010","journal-title":"Theor. Comput. Sci."},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-02737-6_38","volume-title":"Developments in Language Theory","author":"AM Shur","year":"2009","unstructured":"Shur, A.M.: Two-sided bounds for the growth rates of power-free languages. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 466\u2013477. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02737-6_38"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s00233-012-9382-6","volume":"84","author":"AM Shur","year":"2012","unstructured":"Shur, A.M.: Deciding context equivalence of binary overlap-free words in linear time. Semigroup Forum 84, 447\u2013471 (2012)","journal-title":"Semigroup Forum"},{"key":"27_CR19","first-page":"1","volume":"7","author":"A Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 7, 1\u201322 (1906)","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."},{"key":"27_CR20","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. Mat. Nat. Kl. 1, 1\u201367 (1912)","journal-title":"Norske vid. Selsk. Skr. Mat. Nat. Kl."},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1007\/978-3-642-32589-2_69","volume-title":"Mathematical Foundations of Computer Science 2012","author":"IN Tunev","year":"2012","unstructured":"Tunev, I.N., Shur, A.M.: On two stronger versions of dejean\u2019s conjecture. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 800\u2013812. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_69"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:03:22Z","timestamp":1710349402000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","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":"71","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":"31","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":"0","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":"44% - 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":"2.27","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)"}}]}}