{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T17:07:19Z","timestamp":1768583239739,"version":"3.49.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319628080","type":"print"},{"value":"9783319628097","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_26","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T08:37:57Z","timestamp":1500539877000},"page":"345-352","source":"Crossref","is-referenced-by-count":3,"title":["On the Number of Rich Words"],"prefix":"10.1007","author":[{"given":"Josef","family":"Rukavicka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"26_CR1","unstructured":"Balkov\u00e1, L.: Beta-integers and Quasicrystals, Ph. D. thesis, Czech Technical University in Prague and Universit\u00e9 Paris Diderot-Paris 7 (2008)"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1051\/ita\/2011002","volume":"44","author":"L Balkov\u00e1","year":"2010","unstructured":"Balkov\u00e1, L., Pelantov\u00e1, E., Starosta, \u0160.: Sturmian jungle (or garden?) on multiliteral alphabets. RAIRO Theor. Inf. Appl. 44, 443\u2013470 (2010)","journal-title":"RAIRO Theor. Inf. Appl."},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-21500-6_6","volume-title":"Developments in Language Theory","author":"H Bannai","year":"2015","unstructured":"Bannai, H., Gagie, T., Inenaga, S., K\u00e4rkk\u00e4inen, J., Kempa, D., Pi\u0105tkowski, M., Puglisi, S.J., Sugimoto, S.: Diverse palindromic factorization is NP-complete. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 85\u201396. Springer, Cham (2015). doi: 10.1007\/978-3-319-21500-6_6"},{"key":"26_CR4","doi-asserted-by":"crossref","first-page":"6455","DOI":"10.1016\/j.tcs.2011.08.007","volume":"412","author":"AB Mass\u00e9","year":"2011","unstructured":"Mass\u00e9, A.B., Brlek, S., Labb\u00e9, S., Vuillon, L.: Palindromic complexity of codings of rotations. Theor. Comput. Sci. 412, 6455\u20136463 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"2860","DOI":"10.1016\/j.tcs.2008.11.001","volume":"410","author":"M Bucci","year":"2009","unstructured":"Bucci, M., De Luca, A., Glen, A., Zamboni, L.Q.: A new characteristic property of rich words. Theor. Comput. Sci. 410, 2860\u20132863 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR6","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0304-3975(99)00320-5","volume":"255","author":"X Droubay","year":"2001","unstructured":"Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theor. Comput. Sci. 255, 539\u2013553 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1016\/j.aam.2013.01.002","volume":"50","author":"A Frid","year":"2013","unstructured":"Frid, A., Puzynina, S., Zamboni, L.: On palindromic factorization of words. Adv. Appl. Math. 50, 737\u2013748 (2013)","journal-title":"Adv. Appl. Math."},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.ejc.2008.04.006","volume":"30","author":"A Glen","year":"2009","unstructured":"Glen, A., Justin, J., Widmer, S., Zamboni, L.Q.: Palindromic richness. Eur. J. Comb. 30, 510\u2013531 (2009)","journal-title":"Eur. J. Comb."},{"key":"26_CR9","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1016\/j.ipl.2016.07.001","volume":"116","author":"C Guo","year":"2016","unstructured":"Guo, C., Shallit, J., Shur, A.M.: Palindromic rich words and run-length encodings. Inform. Process. Lett. 116, 735\u2013738 (2016)","journal-title":"Inform. Process. Lett."},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.tcs.2013.07.021","volume":"518","author":"E Pelantov\u00e1","year":"2014","unstructured":"Pelantov\u00e1, E., Starosta, \u0160.: Palindromic richness for languages invariant under more symmetries. Theor. Comput. Sci. 518, 42\u201363 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-319-29516-9_27","volume-title":"Combinatorial Algorithms","author":"M Rubinchik","year":"2016","unstructured":"Rubinchik, M., Shur, A.M.: EERTREE: an efficient data structure for processing palindromes in strings. In: Lipt\u00e1k, Z., Smyth, W.F. (eds.) IWOCA 2015. LNCS, vol. 9538, pp. 321\u2013333. Springer, Cham (2016). doi: 10.1007\/978-3-319-29516-9_27"},{"key":"26_CR12","first-page":"371","volume":"145","author":"M Rubinchik","year":"2016","unstructured":"Rubinchik, M., Shur, A.M.: The number of distinct subpalindromes in random words. Fund. Inf. 145, 371\u2013384 (2016)","journal-title":"Fund. Inf."},{"key":"26_CR13","doi-asserted-by":"crossref","first-page":"P1.25","DOI":"10.37236\/5752","volume":"23","author":"L Schaeffer","year":"2016","unstructured":"Schaeffer, L., Shallit, J.: Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences. Electr. J. Comb. 23, P1.25 (2016)","journal-title":"Electr. J. Comb."},{"key":"26_CR14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.cosrev.2012.09.001","volume":"6","author":"AM Shur","year":"2012","unstructured":"Shur, A.M.: Growth properties of power-free languages. Comput. Sci. Rev. 6, 187\u2013208 (2012)","journal-title":"Comput. Sci. Rev."},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.tcs.2014.06.033","volume":"548","author":"J Vesti","year":"2014","unstructured":"Vesti, J.: Extensions of rich words. Theor. Comput. Sci. 548, 14\u201324 (2014)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62809-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T01:19:49Z","timestamp":1602551989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}