{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:23:36Z","timestamp":1743038616275,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319948119"},{"type":"electronic","value":"9783319948126"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94812-6_23","type":"book-chapter","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T22:12:26Z","timestamp":1530223946000},"page":"274-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Values for Factor Complexity"],"prefix":"10.1007","author":[{"given":"Birzhan","family":"Moldagaliyev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludwig","family":"Staiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","unstructured":"Calude, C.S.: Information and Randomness - An Algorithmic Perspective, 2nd (edn.). Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-662-04978-5","DOI":"10.1007\/978-3-662-04978-5"},{"key":"23_CR2","unstructured":"Cassaigne, J.: Special factors of sequences with linear subword complexity. In: Developments in Language Theory, DLT 1995, pp. 25\u201334. World Scientific Publishing, Singapore (1996)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-662-44522-8_13","volume-title":"Mathematical Foundations of Computer Science 2014","author":"J Cassaigne","year":"2014","unstructured":"Cassaigne, J., Frid, A.E., Puzynina, S., Zamboni, L.Q.: Subword complexity and decomposition of the set of factors. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 147\u2013158. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44522-8_13"},{"key":"23_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"RG Downey","year":"2010","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-0-387-68441-3"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(75)90012-2","volume":"1","author":"A Ehrenfeucht","year":"1975","unstructured":"Ehrenfeucht, A., Lee, K.P., Rozenberg, G.: Subword complexities of various classes of deterministic developmental languages without interactions. Theor. Comput. Sci. 1, 59\u201375 (1975)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(81)90028-1","volume":"16","author":"A Ehrenfeucht","year":"1981","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On the subword complexity of square-free D0L languages. Theor. Comput. Sci. 16, 25\u201332 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/0470013850","volume-title":"Fractal Geometry - Mathematical Foundations and Applications","author":"K Falconer","year":"2003","unstructured":"Falconer, K.: Fractal Geometry - Mathematical Foundations and Applications, 2nd edn. Wiley, Hoboken (2003)","edition":"2"},{"issue":"4","key":"23_CR8","doi-asserted-by":"publisher","first-page":"1187","DOI":"10.1017\/etds.2015.84","volume":"37","author":"J Frisch","year":"2017","unstructured":"Frisch, J., Tamuz, O.: Symbolic dynamics on amenable groups: the entropy of generic shifts. Ergodic Theory Dyn. Syst. 37(4), 1187\u20131210 (2017)","journal-title":"Ergodic Theory Dyn. Syst."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Furstenberg, H.: Intersections of cantor sets and transversality of semigroups. In: Problems in Analysis: a Symposium in Honor of Salomon Bochner, pp. 41\u201359 (1970)","DOI":"10.1515\/9781400869312-004"},{"issue":"1\u20132","key":"23_CR10","first-page":"157","volume":"79","author":"F Hausdorff","year":"1919","unstructured":"Hausdorff, F.: Dimension und \u00e4u\u00dferes Ma\u00df (Dimension and outer measure). Mathematische Annalen 79(1\u20132), 157\u2013179 (1919)","journal-title":"Mathematische Annalen"},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"2011","DOI":"10.4007\/annals.2010.171.2011","volume":"171","author":"M Hochman","year":"2010","unstructured":"Hochman, M., Meyerovitch, T.: A characterization of the entropies of multidimensional shifts of finite type. Ann. Math. 171(3), 2011\u20132038 (2010)","journal-title":"Ann. Math."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.tcs.2016.10.003","volume":"679","author":"S Hoffmann","year":"2017","unstructured":"Hoffmann, S., Schwarz, S., Staiger, L.: Shift-invariant topologies for the Cantor Space $$X^\\omega $$. Theor. Comput. Sci. 679, 145\u2013161 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR13","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)","edition":"2"},{"key":"23_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-0-387-49820-1","edition":"3"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0890-5401(03)00187-1","volume":"187","author":"JH Lutz","year":"2003","unstructured":"Lutz, J.H.: The dimensions of individual strings and sequences. Inf. Comput. 187, 49\u201379 (2003)","journal-title":"Inf. Comput."},{"key":"23_CR16","series-title":"Cambridge Series in Statistical and Probabilistic Mathematics","volume-title":"Probability on Trees and Networks","author":"R Lyons","year":"2017","unstructured":"Lyons, R., Peres, Y.: Probability on Trees and Networks. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge (2017)"},{"issue":"1","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(02)00343-5","volume":"84","author":"E Mayordomo","year":"2002","unstructured":"Mayordomo, E.: A Kolmogorov complexity characterization of constructive Hausdorff dimension. Inf. Process. Lett. 84(1), 1\u20133 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"23_CR18","doi-asserted-by":"publisher","first-page":"815","DOI":"10.2307\/2371264","volume":"60","author":"M Morse","year":"1938","unstructured":"Morse, M., Hedlund, G.A.: Symbolic dynamics. Am. J. Math. 60(4), 815\u2013866 (1938)","journal-title":"Am. J. Math."},{"key":"23_CR19","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001","volume-title":"Computability and Randomness","author":"A Nies","year":"2009","unstructured":"Nies, A.: Computability and Randomness. Oxford University Press, New York (2009)"},{"key":"23_CR20","unstructured":"Ryabko, B.Ya.: Coding of combinatorial sources and Hausdorff dimension. Soviet Mathematics - Doklady 30(1), 219\u2013222 (1984)"},{"key":"23_CR21","unstructured":"Ryabko, B.Ya.: Noiseless coding of combinatorial sources, Hausdorff dimension and Kolmogorov complexity. Problemy Peredachi Informatsii 22(3), 16\u201326 (1986)"},{"issue":"3","key":"23_CR22","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00224-014-9546-8","volume":"56","author":"SG Simpson","year":"2015","unstructured":"Simpson, S.G.: Symbolic dynamics: Entropy = Dimension = Complexity. Theory Comput. Syst. 56(3), 527\u2013543 (2015)","journal-title":"Theory Comput. Syst."},{"key":"23_CR23","first-page":"768","volume":"124","author":"YG Sinai","year":"1959","unstructured":"Sinai, Y.G.: On the notion of entropy of a dynamical system. Doklady Russ. Acad. Sci. 124, 768\u2013771 (1959)","journal-title":"Doklady Russ. Acad. Sci."},{"issue":"2","key":"23_CR24","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. Inf. Comput. 103(2), 159\u2013194 (1993)","journal-title":"Inf. Comput."},{"issue":"3","key":"23_CR25","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ipl.2004.09.023","volume":"93","author":"L Staiger","year":"2005","unstructured":"Staiger, L.: Constructive dimension equals Kolmogorov complexity. Inf. Process. Lett. 93(3), 149\u2013153 (2005)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"23_CR26","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.tcs.2007.04.013","volume":"381","author":"L Staiger","year":"2007","unstructured":"Staiger, L.: The Kolmogorov complexity of infinite words. Theor. Comput. Sci. 381(1\u20133), 187\u2013199 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"23_CR27","unstructured":"Staiger, L.: Finite automata and randomness. Invited Talk (without proceedings) at Jewels of Automata: from Mathematics to Applications, Leipzig, 6\u20139 May 2015. http:\/\/www.automatha.uni-leipzig.de\/"},{"issue":"4","key":"23_CR28","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1007\/s00224-017-9790-9","volume":"61","author":"L Staiger","year":"2017","unstructured":"Staiger, L.: Exact constructive and computable dimensions. Theory Comput. Syst. 61(4), 1288\u20131314 (2017)","journal-title":"Theory Comput. Syst."},{"key":"23_CR29","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"AK Zvonkin","year":"1970","unstructured":"Zvonkin, A.K., Levin, L.A.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russ. Math. Surv. 25, 83\u2013124 (1970)","journal-title":"Russ. Math. Surv."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94812-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:54:39Z","timestamp":1709826879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94812-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948119","9783319948126"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94812-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Charlottetown, PE","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.smcs.upei.ca\/ciaa2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}