{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:15:17Z","timestamp":1743077717062,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_13","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:12:23Z","timestamp":1407838343000},"page":"147-158","source":"Crossref","is-referenced-by-count":1,"title":["Subword Complexity and Decomposition of the Set of Factors"],"prefix":"10.1007","author":[{"given":"Julien","family":"Cassaigne","sequence":"first","affiliation":[]},{"given":"Anna E.","family":"Frid","sequence":"additional","affiliation":[]},{"given":"Svetlana","family":"Puzynina","sequence":"additional","affiliation":[]},{"given":"Luca Q.","family":"Zamboni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1142\/S0218196705002116","volume":"15","author":"S.V. Avgustinovich","year":"2005","unstructured":"Avgustinovich, S.V., Frid, A.E.: A unique decomposition theorem for factorial languages. Int. J. Alg. Comput.\u00a015, 149\u2013160 (2005)","journal-title":"Int. J. Alg. Comput."},{"key":"13_CR2","unstructured":"Cassaigne, J.: Special factors of sequences with linear subword complexity. DLT 1995, 25\u201334. World Sci. Publishing, Singapore (1996)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Cassaigne, J., Nicolas, F.: Factor complexity. Combinatorics, automata and number theory. Encyclopedia Math. Appl., vol.\u00a0135, pp. 163\u2013247. Cambridge Univ. Press (2010)","DOI":"10.1017\/CBO9780511777653.005"},{"key":"13_CR4","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 deterministic developmental languages without interactions. Theoret. Comput. Sci.\u00a01, 59\u201376 (1975)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR5","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.Q.: On palindromic factorization of words. Advances in Applied Mathematics\u00a050, 737\u2013748 (2013)","journal-title":"Advances in Applied Mathematics"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/11779148_14","volume-title":"Developments in Language Theory","author":"Y.-S. Han","year":"2006","unstructured":"Han, Y.-S., Salomaa, K., Wood, D.: Prime Decompositions of Regular Languages. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 145\u2013155. Springer, Heidelberg (2006)"},{"issue":"1","key":"13_CR7","first-page":"79","volume":"48","author":"J. Leroy","year":"2012","unstructured":"Leroy, J.: Some improvements of the S -adic conjecture. Adv. Appl. Math.\u00a048(1), 79\u201398 (2012)","journal-title":"Appl. Math."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic combinatorics on words. Cambridge University Press (2002)","DOI":"10.1017\/CBO9781107326019"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"815","DOI":"10.2307\/2371264","volume":"60","author":"M. Morse","year":"1938","unstructured":"Morse, M., Hedlund, G.: Symbolic dynamics. Amer. J. Math.\u00a060, 815\u2013866 (1938)","journal-title":"Amer. J. Math."},{"key":"13_CR10","series-title":"LNCS","first-page":"380","volume-title":"ICALP 1984","author":"J.-J. Pansiot","year":"1984","unstructured":"Pansiot, J.-J.: Complexit\u00e9 des facteurs des mots infinis engendr\u00e9s par morphismes it\u00e9r\u00e9s. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172, pp. 380\u2013389. Springer, Heidelberg (1984)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T23:35:11Z","timestamp":1675121711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}