{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:06Z","timestamp":1759639086839,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"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_11","type":"book-chapter","created":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:03:24Z","timestamp":1630883004000},"page":"129-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Billaud Words and Their Companions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6697-7170","authenticated-orcid":false,"given":"Szymon","family":"\u0141opaciuk","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7996-5291","authenticated-orcid":false,"given":"Daniel","family":"Reidenbach","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"11_CR1","unstructured":"Billaud, M.: A problem with words. Newsgroup \u2018comp.theory\u2019 (1993). https:\/\/groups.google.com\/d\/msg\/comp.theory\/V_xDDtoR9a4\/zgcM4We0CisJ"},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1051\/ita\/1989230100451","volume":"23","author":"G Fil\u00e8","year":"1989","unstructured":"Fil\u00e8, G.: The relation of two patterns with comparable languages patterns. RAIRO - Theor. Inf. Appl. (Informatique Th\u00e9orique et Applications) 23(1), 45\u201357 (1989)","journal-title":"RAIRO - Theor. Inf. Appl. (Informatique Th\u00e9orique et Applications)"},{"key":"11_CR3","unstructured":"Geser, A.: Your \u2018Problem with Words\u2019 (1993). Private communication to M. Billaud"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Hamm, D., Shallit, J.: Characterization of finite and one-sided infinite fixed points of morphisms on free monoids. Technical report CS-99-17, University of Waterloo, Ontario, Canada (July 1999)","DOI":"10.1007\/3-540-48321-7_41"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1080\/00207168108803273","volume":"10","author":"T Head","year":"1981","unstructured":"Head, T.: Fixed languages and the adult languages of OL schemes. Int. J. Comput. Math. 10(2), 103\u2013107 (1981)","journal-title":"Int. J. Comput. Math."},{"issue":"16","key":"11_CR6","doi-asserted-by":"publisher","first-page":"5069","DOI":"10.1016\/j.disc.2009.03.019","volume":"309","author":"\u0160 Holub","year":"2009","unstructured":"Holub, \u0160: Polynomial-time algorithm for fixed points of nontrivial morphisms. Discret. Math. 309(16), 5069\u20135076 (2009)","journal-title":"Discret. Math."},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/jcss.1995.1006","volume":"50","author":"T Jiang","year":"1995","unstructured":"Jiang, T., Salomaa, A., Salomaa, K., Yu, S.: Decision Problems for Patterns. J. Comput. Syst. Sci. 50(1), 53\u201363 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.tcs.2015.07.055","volume":"602","author":"T Kociumaka","year":"2015","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: Linear-time version of Holub\u2019s algorithm for morphic imprimitivity testing. Theoret. Comput. Sci. 602, 7\u201321 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2005.01.011","volume":"339","author":"F Lev\u00e9","year":"2005","unstructured":"Lev\u00e9, F., Richomme, G.: On a conjecture about finite fixed points of morphisms. Theoret. Comput. Sci. 339(1), 103\u2013128 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"11_CR10","first-page":"216","volume":"49","author":"V Matocha","year":"2013","unstructured":"Matocha, V., Holub, \u0160: Complexity of testing morphic primitivity. Kybernetika 49(2), 216\u2013223 (2013)","journal-title":"Kybernetika"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-642-31653-1_39","volume-title":"Developments in Language Theory","author":"H Nevisi","year":"2012","unstructured":"Nevisi, H., Reidenbach, D.: Morphic primitivity and alphabet reductions. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 440\u2013451. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31653-1_39"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tcs.2008.02.029","volume":"397","author":"D Reidenbach","year":"2008","unstructured":"Reidenbach, D.: Discontinuities in pattern inference. Theoret. Comput. Sci. 397(1), 166\u2013193 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"21","key":"11_CR13","doi-asserted-by":"publisher","first-page":"2148","DOI":"10.1016\/j.tcs.2009.01.020","volume":"410","author":"D Reidenbach","year":"2009","unstructured":"Reidenbach, D., Schneider, J.C.: Morphically primitive words. Theoret. Comput. Sci. 410(21), 2148\u20132161 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR14","unstructured":"Walter, T.: \u00dcber die Billaudsche Vermutung. Diplomarbeit, Universit\u00e4t Stuttgart, Fakult\u00e4t Informatik, Elektrotechnik und Informationstechnik, Stuttgart, Germany (August 2011)"},{"key":"11_CR15","unstructured":"Zimmermann, P.: A problem with words from Michel Billaud (1993). Private communication to M. Billaud"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T16:50:23Z","timestamp":1673196623000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85088-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850876","9783030850883"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85088-3_11","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)"}}]}}