{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:09:19Z","timestamp":1743066559619,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_5","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"71-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Ergodic Infinite Permutations of Minimal Complexity"],"prefix":"10.1007","author":[{"given":"Sergey V.","family":"Avgustinovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna E.","family":"Frid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Svetlana","family":"Puzynina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Allouche, J.-P., Shallit, J.: Automatic sequences \u2013 theory, applications, generalizations. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511546563"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Allouche, J.-P., Shallit, J.: The ubiquitous Prouhet-Thue-Morse sequence. In: Sequences and Their Applications, Discrete Mathematics and Theoretical Computer Science, pp. 1\u201316. Springer, London (1999)","DOI":"10.1007\/978-1-4471-0551-0_1"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Amig\u00f3, J.: Permutation Complexity in Dynamical Systems - Ordinal Patterns. Permutation Entropy and All That, Springer Series in Synergetics (2010)","DOI":"10.1007\/978-3-642-04084-9"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"2911","DOI":"10.1016\/j.tcs.2010.12.062","volume":"412","author":"SV Avgustinovich","year":"2011","unstructured":"Avgustinovich, S.V., Frid, A., Kamae, T., Salimov, P.: Infinite permutations of lowest maximal pattern complexity. Theoretical Computer Science 412, 2911\u20132921 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"5_CR5","first-page":"3","volume":"16","author":"SV Avgustinovich","year":"2011","unstructured":"Avgustinovich, S.V., Kitaev, S., Pyatkin, A., Valyuzhenich, A.: On square-free permutations. J. Autom. Lang. Comb. 16(1), 3\u201310 (2011)","journal-title":"J. Autom. Lang. Comb."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"1595","DOI":"10.1088\/0951-7715\/15\/5\/312","volume":"15","author":"C Bandt","year":"2002","unstructured":"Bandt, C., Keller, G., Pompe, B.: Entropy of interval maps via permutations. Nonlinearity 15, 1595\u20131602 (2002)","journal-title":"Nonlinearity"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1017\/CBO9780511777653.005","volume":"135","author":"J Cassaigne","year":"2010","unstructured":"Cassaigne, J., Nicolas, F.: Factor complexity. Combinatorics, automata and number theory, Encyclopedia Math. Appl. 135, 163\u2013247 (2010). Cambridge Univ. Press","journal-title":"Combinatorics, automata and number theory, Encyclopedia Math. Appl."},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1137\/080726689","volume":"23","author":"S Elizalde","year":"2009","unstructured":"Elizalde, S.: The number of permutations realized by a shift. SIAM J. Discrete Math. 23, 765\u2013786 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"5_CR9","first-page":"373","volume":"135","author":"S Ferenczi","year":"2010","unstructured":"Ferenczi, S., Monteil, T.: Infinite words with uniform frequencies, and invariant measures. Combinatorics, automata and number theory. Encyclopedia Math. Appl. 135, 373\u2013409 (2010). Cambridge Univ. Press","journal-title":"Encyclopedia Math. Appl."},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"2106","DOI":"10.1016\/j.ejc.2007.04.017","volume":"28","author":"DG Fon-Der-Flaass","year":"2007","unstructured":"Fon-Der-Flaass, D.G., Frid, A.E.: On periodicity and low complexity of infinite permutations. European J. Combin. 28, 2106\u20132114 (2007)","journal-title":"European J. Combin."},{"key":"5_CR11","first-page":"377","volume":"9","author":"A Frid","year":"2012","unstructured":"Frid, A.: Fine and Wilf\u2019s theorem for permutations. Sib. Elektron. Mat. Izv. 9, 377\u2013381 (2012)","journal-title":"Sib. Elektron. Mat. Izv."},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1051\/ita\/2011129","volume":"46","author":"A Frid","year":"2012","unstructured":"Frid, A., Zamboni, L.: On automatic infinite permutations. Theoret. Inf. Appl. 46, 77\u201385 (2012)","journal-title":"Theoret. Inf. Appl."},{"key":"5_CR13","first-page":"1191","volume":"22","author":"T Kamae","year":"2002","unstructured":"Kamae, T., Zamboni, L.: Sequence entropy and the maximal pattern complexity of infinite words. Ergodic Theory and Dynamical Systems 22, 1191\u20131199 (2002)","journal-title":"Ergodic Theory and Dynamical Systems"},{"key":"5_CR14","first-page":"1201","volume":"22","author":"T Kamae","year":"2002","unstructured":"Kamae, T., Zamboni, L.: Maximal pattern complexity for discrete systems. Ergodic Theory and Dynamical Systems 22, 1201\u20131214 (2002)","journal-title":"Ergodic Theory and Dynamical Systems"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic combinatorics on words. Cambridge University Press (2002)","DOI":"10.1017\/CBO9781107326019"},{"key":"5_CR16","first-page":"304","volume":"3","author":"M Makarov","year":"2006","unstructured":"Makarov, M.: On permutations generated by infinite binary words. Sib. Elektron. Mat. Izv. 3, 304\u2013311 (2006)","journal-title":"Sib. Elektron. Mat. Izv."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"6641","DOI":"10.1016\/j.disc.2009.06.030","volume":"309","author":"M Makarov","year":"2009","unstructured":"Makarov, M.: On an infinite permutation similar to the Thue-Morse word. Discrete Math. 309, 6641\u20136643 (2009)","journal-title":"Discrete Math."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/s11202-009-0076-6","volume":"50","author":"M Makarov","year":"2009","unstructured":"Makarov, M.: On the permutations generated by Sturmian words. Sib. Math. J. 50, 674\u2013680 (2009)","journal-title":"Sib. Math. J."},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2371431","volume":"62","author":"M Morse","year":"1940","unstructured":"Morse, M., Hedlund, G.: Symbolic dynamics II: Sturmian sequences. Amer. J. Math. 62, 1\u201342 (1940)","journal-title":"Amer. J. Math."},{"key":"5_CR20","first-page":"95","volume":"16","author":"A Valyuzhenich","year":"2014","unstructured":"Valyuzhenich, A.: On permutation complexity of fixed points of uniform binary morphisms. Discr. Math. Theoret. Comput. Sci. 16, 95\u2013128 (2014)","journal-title":"Discr. Math. Theoret. Comput. Sci."},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.aam.2010.08.002","volume":"47","author":"S Widmer","year":"2011","unstructured":"Widmer, S.: Permutation complexity of the Thue-Morse word. Adv. Appl. Math. 47, 309\u2013329 (2011)","journal-title":"Adv. Appl. Math."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Widmer, S.: Permutation complexity related to the letter doubling map, WORDS (2011)","DOI":"10.4204\/EPTCS.63.33"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T10:44:19Z","timestamp":1676025859000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}