{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T06:55:08Z","timestamp":1725692108812},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316432"},{"type":"electronic","value":"9783642316449"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-31644-9_16","type":"book-chapter","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T22:17:08Z","timestamp":1342649828000},"page":"236-245","source":"Crossref","is-referenced-by-count":1,"title":["Asymptotic Subword Complexity"],"prefix":"10.1007","author":[{"given":"Ludwig","family":"Staiger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic sequences","author":"J.P. Allouche","year":"2003","unstructured":"Allouche, J.P., Shallit, J.: Automatic sequences. Cambridge University Press, Cambridge (2003)"},{"key":"16_CR2","first-page":"178","volume":"79","author":"J. Berstel","year":"2003","unstructured":"Berstel, J., Karhum\u00e4ki, J.: Combinatorics on words: a tutorial. Bulletin of the EATCS\u00a079, 178\u2013228 (2003)","journal-title":"Bulletin of the EATCS"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0019-9958(58)90082-2","volume":"1","author":"N. Chomsky","year":"1958","unstructured":"Chomsky, N., Miller, G.A.: Finite state languages. Information and Control\u00a01, 91\u2013112 (1958)","journal-title":"Information and Control"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","volume":"8","author":"Y. Choueka","year":"1974","unstructured":"Choueka, Y.: Theories of automata on \u03c9-tapes: a simplified approach. J. Comput. System Sci.\u00a08, 117\u2013141 (1974)","journal-title":"J. Comput. System Sci."},{"key":"16_CR5","volume-title":"Automata, languages, and machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, languages, and machines, vol.\u00a0A. Academic Press, New York (1974)"},{"key":"16_CR6","volume-title":"Fractal geometry","author":"K. Falconer","year":"1990","unstructured":"Falconer, K.: Fractal geometry. John Wiley & Sons Ltd., Chichester (1990)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/3-540-55210-3_209","volume-title":"STACS 92","author":"G. Hansel","year":"1992","unstructured":"Hansel, G., Perrin, D., Simon, I.: Compression and Entropy. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol.\u00a0577, pp. 515\u2013528. Springer, Heidelberg (1992)"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0019-9958(70)90105-1","volume":"16","author":"W. Kuich","year":"1970","unstructured":"Kuich, W.: On the entropy of context-free languages. Information and Control\u00a016, 173\u2013200 (1970)","journal-title":"Information and Control"},{"key":"16_CR9","first-page":"170","volume":"82","author":"S. Marcus","year":"2004","unstructured":"Marcus, S.: Quasiperiodic infinite words. Bulletin of the EATCS\u00a082, 170\u2013174 (2004)","journal-title":"Bulletin of the EATCS"},{"key":"16_CR10","first-page":"301","volume-title":"Proceedings of Symposium on Logic in Computer Science","author":"D. Perrin","year":"1986","unstructured":"Perrin, D., Schupp, P.E.: Automata on the integers, recurrence distinguishability, and the equivalence and decidability of monadic theories. In: Proceedings of Symposium on Logic in Computer Science, June 16-18, pp. 301\u2013304. IEEE Computer Society, Cambridge (1986)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.4204\/EPTCS.31.19","volume":"31","author":"R. Polley","year":"2010","unstructured":"Polley, R., Staiger, L.: The maximal subword complexity of quasiperiodic infinite words. Electronic Proceedings in Theoretical Computer Science\u00a031, 169\u2013176 (2010), \n                  \n                    http:\/\/arxiv.org\/abs\/1008.1659","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BFb0030296","volume-title":"Mathematical Foundations of Computer Science 1984","author":"A.L. Semenov","year":"1984","unstructured":"Semenov, A.L.: Decidability of Monadic Theories. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol.\u00a0176, pp. 162\u2013175. Springer, Heidelberg (1984)"},{"issue":"5","key":"16_CR13","first-page":"383","volume":"14","author":"L. Staiger","year":"1985","unstructured":"Staiger, L.: The entropy of finite-state \u03c9-languages. Problems Control Inform. Theory\/Problemy Upravlen. Teor. Inform.\u00a014(5), 383\u2013392 (1985)","journal-title":"Problems Control Inform. Theory\/Problemy Upravlen. Teor. Inform."},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0378-3758(89)90042-6","volume":"23","author":"L. Staiger","year":"1989","unstructured":"Staiger, L.: Combinatorial properties of the Hausdorff dimension. J. Statist. Plann. Inference\u00a023(1), 95\u2013100 (1989)","journal-title":"J. Statist. Plann. Inference"},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1017","volume":"103","author":"L. Staiger","year":"1993","unstructured":"Staiger, L.: Kolmogorov complexity and Hausdorff dimension. Inform. and Comput.\u00a0103(2), 159\u2013194 (1993)","journal-title":"Inform. and Comput."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-59126-6_6","volume-title":"Handbook of Formal Languages","author":"L. Staiger","year":"1997","unstructured":"Staiger, L.: \u03c9-Languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 339\u2013387. Springer, Berlin (1997)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/3-540-62844-4_27","volume-title":"New Trends in Formal Languages","author":"L. Staiger","year":"1997","unstructured":"Staiger, L.: On \u03c9-Power Languages. In: P\u0103un, G., Salomaa, A. (eds.) New Trends in Formal Languages. LNCS, vol.\u00a01218, pp. 377\u2013394. Springer, Heidelberg (1997)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/BFb0028032","volume-title":"Computer Science Logic","author":"L. Staiger","year":"1998","unstructured":"Staiger, L.: Rich \u03c9-Words and Monadic Second-Order Arithmetic. In: Nielsen, M., Thomas, W. (eds.) CSL 1997. LNCS, vol.\u00a01414, pp. 478\u2013490. Springer, Heidelberg (1998)"},{"issue":"4","key":"16_CR19","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1051\/ita:2005032","volume":"39","author":"L. Staiger","year":"2005","unstructured":"Staiger, L.: The entropy of \u0141ukasiewicz-languages. Theor. Inform. Appl.\u00a039(4), 621\u2013639 (2005)","journal-title":"Theor. Inform. Appl."},{"key":"16_CR20","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013191. Elsevier Science Publishers B.V., Amsterdam (1990)"},{"issue":"4","key":"16_CR21","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1051\/ita:2005033","volume":"39","author":"K. Thomsen","year":"2005","unstructured":"Thomsen, K.: Languages of finite words occurring infinitely many times in an infinite word. Theor. Inform. Appl.\u00a039(4), 641\u2013650 (2005)","journal-title":"Theor. Inform. Appl."}],"container-title":["Lecture Notes in Computer Science","Languages Alive"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31644-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T23:16:17Z","timestamp":1556925377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31644-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316432","9783642316449"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31644-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}