{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T16:52:56Z","timestamp":1768582376847,"version":"3.49.0"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2004,4]]},"abstract":"<jats:p> We study the problem of constructing infinite words having a prescribed finite set P of palindromes. We first establish that the language of all words with palindromic factors in P is rational. As a consequence we derive that there exists, with some additional mild condition, infinite words having P as palindromic factors. We prove that there exist periodic words having the maximum number of palindromes as in the case of Sturmian words, by providing a simple and easy to check condition. Asymmetric words, those that are not the product of two palindromes, play a fundamental role and an enumeration is provided. <\/jats:p>","DOI":"10.1142\/s012905410400242x","type":"journal-article","created":{"date-parts":[[2004,4,22]],"date-time":"2004-04-22T09:19:46Z","timestamp":1082625586000},"page":"293-306","source":"Crossref","is-referenced-by-count":67,"title":["ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS"],"prefix":"10.1142","volume":"15","author":[{"given":"S.","family":"BRLEK","sequence":"first","affiliation":[{"name":"LACIM, Universit\u00e9 du Qu\u00e9bec  \u00e0 Montr\u00e9al, Montr\u00e9al (QC) CANADA H3C 3P8, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"HAMEL","sequence":"additional","affiliation":[{"name":"McGill University,  Montr\u00e9al (QC) CANADA H3C 3P8, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"NIVAT","sequence":"additional","affiliation":[{"name":"LIAFA, Universit\u00e9 Denis Diderot,  Montr\u00e9al (QC) CANADA H3C 3P8, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"REUTENAUER","sequence":"additional","affiliation":[{"name":"LaCIM, Universit\u00e9 du Qu\u00e9bec  \u00e0 Montr\u00e9al, Montr\u00e9al (QC) CANADA H3C 3P8, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1006\/aama.2001.0776"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00212-2"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00746-6"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00188-6"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00320-5"},{"key":"rf7","volume-title":"Introduction to Lie algebras and representation theory","author":"Humphreys J. E.","year":"1980"},{"key":"rf8","volume-title":"Combinatorics on words","author":"Lothaire M.","year":"1983"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00310-6"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.2307\/2371264"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905410400242X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:37:22Z","timestamp":1565123842000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905410400242X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":10,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2004,4]]}},"alternative-id":["10.1142\/S012905410400242X"],"URL":"https:\/\/doi.org\/10.1142\/s012905410400242x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}