{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:15:24Z","timestamp":1743059724813,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030625351"},{"type":"electronic","value":"9783030625368"}],"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_18","type":"book-chapter","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T02:02:50Z","timestamp":1604714570000},"page":"219-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Generative Power of Quasiperiods"],"prefix":"10.1007","author":[{"given":"Ludwig","family":"Staiger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"issue":"1","key":"18_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(91)90056-N","volume":"39","author":"A Apostolico","year":"1991","unstructured":"Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal superprimitivity testing for strings. Inf. Process. Lett. 39(1), 17\u201320 (1991). https:\/\/doi.org\/10.1016\/0020-0190(91)90056-N","journal-title":"Inf. Process. Lett."},{"key":"18_CR2","volume-title":"Theory of Codes","author":"J Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of Codes. Academic Press, Orlando (1985)"},{"key":"18_CR3","volume-title":"Rational Series and Their Languages, EATCS Monographs on Theoretical Computer Science","author":"J Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages, EATCS Monographs on Theoretical Computer Science, vol. 12. Springer, Berlin (1988)"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1145\/321406.321409","volume":"14","author":"JA Brzozowski","year":"1967","unstructured":"Brzozowski, J.A.: Roots of star events. J. ACM 14(3), 466\u2013477 (1967). https:\/\/doi.org\/10.1145\/321406.321409","journal-title":"J. ACM"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Am. Math. Soc. 16, 109\u2013114 (1965)","journal-title":"Proc. Am. Math. Soc."},{"key":"18_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on Words, 2nd edn. Cambridge University Press, Cambridge (1997)","edition":"2"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0304-3975(00)00065-7","volume":"249","author":"L Mouchard","year":"2000","unstructured":"Mouchard, L.: Normal forms of quasiperiodic strings. Theor. Comput. Sci. 249(2), 313\u2013324 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(00)00065-7","journal-title":"Theor. Comput. Sci."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Polley, R., Staiger, L.: The maximal subword complexity of quasiperiodic infinite words. In: McQuillan, I., Pighizzini, G. (eds.) Proceedings 12th DCFS, Electronic Proceedings in Theoretical Computer Science (EPTCS), vol. 31, pp. 169\u2013176. Open Publishing Association (2010)","DOI":"10.4204\/EPTCS.31.19"},{"key":"18_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-Theoretic Aspects of Formal Power Series","author":"A Salomaa","year":"1978","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, New York (1978). https:\/\/doi.org\/10.1007\/978-1-4612-6264-0"},{"key":"18_CR10","volume-title":"Free Monoids and Languages","author":"HJ Shyr","year":"2001","unstructured":"Shyr, H.J.: Free Monoids and Languages, 3rd edn. Hon Min Book Company, Taichung (2001)","edition":"3"},{"issue":"5","key":"18_CR11","first-page":"383","volume":"14","author":"L Staiger","year":"1985","unstructured":"Staiger, L.: The entropy of finite-state $$\\omega $$-languages. Probl. Control Inform. Theory\/Problemy Upravlen. Teor. Inform. 14(5), 383\u2013392 (1985)","journal-title":"Probl. Control Inform. Theory\/Problemy Upravlen. Teor. Inform."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Staiger, L.: Quasiperiods of infinite words. In: Bellow, A., Calude, C.S., Zamfirescu, T. (eds.) Mathematics Almost Everywhere. In Memory of Solomon Marcus, pp. 17\u201336. World Scientific, Hackensack (2018)","DOI":"10.1142\/9789813237315_0002"}],"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_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T12:05:40Z","timestamp":1741608340000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62536-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625351","9783030625368"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62536-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}