{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:42Z","timestamp":1759638222417,"version":"3.40.3"},"publisher-location":"Cham","reference-count":5,"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_4","type":"book-chapter","created":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:03:24Z","timestamp":1630883004000},"page":"40-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Strings from Linear Recurrences: A Gray Code"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5646-4790","authenticated-orcid":false,"given":"Elena","family":"Barcucci","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5363-7756","authenticated-orcid":false,"given":"Antonio","family":"Bernini","sequence":"additional","affiliation":[]},{"given":"Renzo","family":"Pinzani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,6]]},"reference":[{"key":"4_CR1","unstructured":"Barcucci, E., Bernini, A., Pinzani, R.: A gray code for a regular language. In: Ferrari, L., Vamvakari, M. (eds.) GASCom 2018, CEUR Workshop Proceedings, vol. 2113, pp. 87\u201393 (2018). http:\/\/ceur-ws.org\/Vol-2113\/"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/S0304-3975(00)00398-4","volume":"255","author":"E Barcucci","year":"2001","unstructured":"Barcucci, E., Rinaldi, S.: Some linear recurrences and their combinatorial interpretation by means of regular languages. Theoret. Comput. Sci. 255, 679\u2013686 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00236-015-0225-2","volume":"52","author":"A Bernini","year":"2015","unstructured":"Bernini, A., Bilotta, S., Pinzani, R., Sabri, A., Vajnovszki, V.: Gray code orders for $$q$$-ary words avoiding a given factor. Acta Inform. 52, 573\u2013592 (2015)","journal-title":"Acta Inform."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1080\/00029890.1985.11971550","volume":"92","author":"AS Fraenkel","year":"1985","unstructured":"Fraenkel, A.S.: Systems of numeration. Amer. Math. Monthly 92, 105\u2013114 (1985)","journal-title":"Amer. Math. Monthly"},{"key":"4_CR5","unstructured":"Sloane, N.J.A.: The online encyclopedia of integer sequences (2003). http:\/\/oeis.org"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,5]],"date-time":"2021-09-05T23:04:11Z","timestamp":1630883051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85088-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850876","9783030850883"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85088-3_4","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)"}}]}}