{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:56:57Z","timestamp":1776859017376,"version":"3.51.2"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030625351","type":"print"},{"value":"9783030625368","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62536-8_14","type":"book-chapter","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T02:02:50Z","timestamp":1604714570000},"page":"167-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Palindromic Length of Words with Many Periodic Palindromes"],"prefix":"10.1007","author":[{"given":"Josef","family":"Rukavicka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2019.02.024","volume":"780","author":"P Ambro\u017e","year":"2019","unstructured":"Ambro\u017e, P., Kadlec, O., Mas\u00e1kov\u00e1, Z., Pelantov\u00e1, E.: Palindromic length of words and morphisms in class P. Theor. Comput. Sci. 780, 74\u201383 (2019). https:\/\/doi.org\/10.1016\/j.tcs.2019.02.024","journal-title":"Theor. Comput. Sci."},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-030-24886-4_18","volume-title":"Developments in Language Theory","author":"P Ambro\u017e","year":"2019","unstructured":"Ambro\u017e, P., Pelantov\u00e1, E.: On palindromic length of Sturmian sequences. In: Hofman, P., Skrzypczak, M. (eds.) Developments in Language Theory, pp. 244\u2013250. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24886-4_18"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Borozdin, K., Kosolobov, D., Rubinchik, M., Shur, A.M.: Palindromic length in linear time. In: K\u00e4rkk\u00e4inen, J., Radoszewski, J., Rytter, W. (eds.) 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 78, pp. 23:1\u201323:12. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CPM.2017.23","DOI":"10.4230\/LIPIcs.CPM.2017.23"},{"issue":"03","key":"14_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1142\/S0129054118500077","volume":"29","author":"M Bucci","year":"2018","unstructured":"Bucci, M., Richomme, G.: Greedy palindromic lengths. Int. J. Found. Comput. Sci. 29(03), 331\u2013356 (2018). https:\/\/doi.org\/10.1142\/S0129054118500077","journal-title":"Int. J. Found. Comput. Sci."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.jda.2014.08.001","volume":"28","author":"G Fici","year":"2014","unstructured":"Fici, G., Gagie, T., Kr\u00e4kk\u00e4inen, J., Kempa, D.: A subquadratic algorithm for minimum palindromic factorization. J. Discrete Algorithms 28, 41\u201348 (2014). https:\/\/doi.org\/10.1016\/j.jda.2014.08.001. stringMasters 2012 & 2013 Special Issue (Volume 1)","journal-title":"J. Discrete Algorithms"},{"issue":"5","key":"14_CR6","doi-asserted-by":"publisher","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(5), 737\u2013748 (2013). https:\/\/doi.org\/10.1016\/j.aam.2013.01.002","journal-title":"Adv. Appl. Math."},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/j.ejc.2018.04.003","volume":"71","author":"AE Frid","year":"2018","unstructured":"Frid, A.E.: Sturmian numeration systems and decompositions to palindromes. Eur. J. Comb. 71, 202\u2013212 (2018). https:\/\/doi.org\/10.1016\/j.ejc.2018.04.003","journal-title":"Eur. J. Comb."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-030-24886-4_17","volume-title":"Developments in Language Theory","author":"AE Frid","year":"2019","unstructured":"Frid, A.E.: First lower bounds for palindromic length. In: Hofman, P., Skrzypczak, M. (eds.) Developments in Language Theory, pp. 234\u2013243. Springer International Publishing, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24886-4_17"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-662-46078-8_24","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science","author":"D Kosolobov","year":"2015","unstructured":"Kosolobov, D., Rubinchik, M., Shur, A.M.: Pal$$^k$$ is linear recognizable online. In: Italiano, G.F., Margaria-Steffen, T., Pokorn\u00fd, J., Quisquater, J.J., Wattenhofer, R. (eds.) SOFSEM 2015: Theory and Practice of Computer Science, pp. 289\u2013301. Springer, Berlin Heidelberg, Berlin, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46078-8_24"},{"key":"14_CR10","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). https:\/\/doi.org\/10.1007\/978-3-319-29516-9_27"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-66396-8_19","volume-title":"Combinatorics on Words","author":"A Saarela","year":"2017","unstructured":"Saarela, A.: Palindromic length in free monoids and free groups. In: Brlek, S., Dolce, F., Reutenauer, C., Vandomme, \u00c9. (eds.) WORDS 2017. LNCS, vol. 10432, pp. 203\u2013213. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66396-8_19"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62536-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T19:22:45Z","timestamp":1741634565000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62536-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625351","9783030625368"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62536-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sofl2020.conf.tuwien.ac.at\/DCFS2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}