{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T04:10:49Z","timestamp":1751429449029,"version":"3.41.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2017,10,31]],"date-time":"2017-10-31T00:00:00Z","timestamp":1509408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2017,10,31]]},"abstract":"<jats:p> In this paper we give a combinatorial interpretation of linear recurrences having constant coefficients. In particular, we describe a recursive construction for a language \u2112 such that the words in \u2112 having length n satisfy the given recurrence and avoid a cross-bifix-free set of patterns. <\/jats:p>","DOI":"10.3233\/fi-2017-1595","type":"journal-article","created":{"date-parts":[[2017,10,31]],"date-time":"2017-10-31T16:04:52Z","timestamp":1509465892000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Pattern Avoiding Languages and Recurrence Relations Interpretation"],"prefix":"10.1177","volume":"156","author":[{"given":"Stefano","family":"Bilotta","sequence":"first","affiliation":[{"name":"Dip. Matematica e Informatica \u201cU. Dini\u201d, Universit\u00e0 degli Studi di Firenze, Viale G.B. Morgagni 65 \u2013 50134 Firenze, Italy. , ,"}]},{"given":"Elisabetta","family":"Grazzini","sequence":"additional","affiliation":[{"name":"Dip. Matematica e Informatica \u201cU. Dini\u201d, Universit\u00e0 degli Studi di Firenze, Viale G.B. Morgagni 65 \u2013 50134 Firenze, Italy. , ,"}]},{"given":"Elisa","family":"Pergola","sequence":"additional","affiliation":[{"name":"Dip. Matematica e Informatica \u201cU. Dini\u201d, Universit\u00e0 degli Studi di Firenze, Viale G.B. Morgagni 65 \u2013 50134 Firenze, Italy. , ,"}]}],"member":"179","published-online":{"date-parts":[[2017,10,31]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2017-1595","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2017-1595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:50:01Z","timestamp":1751367001000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2017-1595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,31]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,10,31]]}},"alternative-id":["10.3233\/FI-2017-1595"],"URL":"https:\/\/doi.org\/10.3233\/fi-2017-1595","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"type":"print","value":"0169-2968"},{"type":"electronic","value":"1875-8681"}],"subject":[],"published":{"date-parts":[[2017,10,31]]}}}