{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T22:52:00Z","timestamp":1782168720667,"version":"3.54.5"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,6]]},"abstract":"<jats:p> We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained. <\/jats:p>","DOI":"10.1142\/s0129054106003991","type":"journal-article","created":{"date-parts":[[2006,6,6]],"date-time":"2006-06-06T11:11:37Z","timestamp":1149592297000},"page":"557-573","source":"Crossref","is-referenced-by-count":14,"title":["COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES"],"prefix":"10.1142","volume":"17","author":[{"given":"ALDO","family":"DE LUCA","sequence":"first","affiliation":[{"name":"Dipartimento di Matematica e Applicazioni \"R. Caccioppoli\", Universit\u00e0 degli Studi di Napoli Federico II, via Cintia, Monte S. Angelo, I-80126 Napoli, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"ALESSANDRO","family":"DE LUCA","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica e Applicazioni \"R. Caccioppoli\", Universit\u00e0 degli Studi di Napoli Federico II, via Cintia, Monte S. Angelo, I-80126 Napoli, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563"},{"key":"rf2","volume-title":"Algebraic Combinatorics on Words","author":"Berstel J.","year":"2002"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.036"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.021"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00431-X"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00310-6"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00248-5"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00035-H"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00320-5"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00188-6"},{"key":"rf13","volume-title":"An Introduction to the Theory of Numbers","author":"Hardy G. H.","year":"1979"},{"key":"rf14","volume-title":"Combinatorics on Words","author":"Lothaire M.","year":"1983"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106003991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:28:15Z","timestamp":1565191695000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106003991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":12,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,6]]}},"alternative-id":["10.1142\/S0129054106003991"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106003991","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}