{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T00:13:37Z","timestamp":1760746417966,"version":"build-2065373602"},"reference-count":9,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"vor","delay-in-days":289,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100017142","name":"Gruppo Nazionale per il Calcolo Scientifico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100017142","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2025,9,6]]},"published-print":{"date-parts":[[2025]]},"abstract":"<jats:p>We provide a bijection between the set of the q-decreasing binary words (in the case where <jats:italic>q<\/jats:italic> is an irreducible positive rational number) and a set of binary words avoiding some patterns whose lengths depends on the number <jats:italic>q<\/jats:italic>. Moreover, for such a set we give the details of the construction, the generating function according to the length of its words, and the recurrence relation of the enumerating sequence, depending on <jats:italic>q<\/jats:italic>.<\/jats:p>","DOI":"10.1051\/ita\/2025013","type":"journal-article","created":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T07:47:46Z","timestamp":1760687266000},"page":"13","source":"Crossref","is-referenced-by-count":0,"title":["Pattern avoiding and <i>q<\/i>-decreasing binary words"],"prefix":"10.1051","volume":"59","author":[{"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":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6947-762X","authenticated-orcid":false,"given":"Stefano","family":"Bilotta","sequence":"additional","affiliation":[]},{"given":"Renzo","family":"Pinzani","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.tcs.2022.06.003","volume":"297","author":"Baril","year":"2022","journal-title":"Theoret. Comput. Sci."},{"key":"R2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1080\/00150517.2022.12427439","volume":"60","author":"Kirgizov","year":"2022","journal-title":"Fibonacci Quart."},{"key":"R3","doi-asserted-by":"crossref","first-page":"49","DOI":"10.4204\/EPTCS.403.13","volume":"403","author":"Barcucci","year":"2024","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"R4","first-page":"25.3.2","volume":"28","author":"Barcucci","year":"2025","journal-title":"J. Integer Seq."},{"key":"R5","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1051\/ita\/2024007","volume":"58","author":"Barcucci","year":"2024","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Stanley R., Catalan Numbers. Cambridge University Press, Cambridge (2015).","DOI":"10.1017\/CBO9781139871495"},{"key":"R7","unstructured":"Gray F., Pulse code communication, US Patent 2,632,058, (1953)."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Vajnovszki V., A loopless generation of bitstrings without p consecutive ones, In Proceedings of the Third International Conference on Combinatorics, Computability and Logic, edited by Calude C.S., Dinneen M.J. and Sburlan S. (2001) 227\u2013240.","DOI":"10.1007\/978-1-4471-0717-0_19"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Barcucci E., Bernini A. and Pinzani R., Exhaustive generation of some lattice paths and their prefixes. Theoret. Comput. Sci. 878\u2013879 (2021) 47\u201352.","DOI":"10.1016\/j.tcs.2020.12.013"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2025013\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T07:47:48Z","timestamp":1760687268000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2025013"}},"subtitle":[],"editor":[{"given":"Vincent","family":"Vajnovszki","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Bernini","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":9,"alternative-id":["ita250013"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2025013","relation":{},"ISSN":["0988-3754","2804-7346"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"2804-7346","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}