{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:56:31Z","timestamp":1725468991436},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377917"},{"type":"electronic","value":"9783540377931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_25","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T10:25:12Z","timestamp":1156501512000},"page":"280-291","source":"Crossref","is-referenced-by-count":1,"title":["The Lempel-Ziv Complexity of Fixed Points of Morphisms"],"prefix":"10.1007","author":[{"given":"Sorin","family":"Constantinescu","sequence":"first","affiliation":[]},{"given":"Lucian","family":"Ilie","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"25_CR1","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1162\/089976604322860677","volume":"16","author":"J.M. Amigo","year":"2004","unstructured":"Amigo, J.M., Szczepanski, J., Wajnryb, E., Sanchez-Vives, M.V.: Estimating the entropy rate of spike trains via Lempel-Ziv complexity. Neural Computation\u00a016(4), 717\u2013736 (2004)","journal-title":"Neural Computation"},{"key":"25_CR2","first-page":"758","volume":"49","author":"N.G. Bruijn de","year":"1946","unstructured":"de Bruijn, N.G.: A combinatorial problem. Nederl. Akad. Wetensch. Proc.\u00a049, 758\u2013764 (1946)","journal-title":"Nederl. Akad. Wetensch. Proc."},{"key":"25_CR3","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"G. Chaitin","year":"1966","unstructured":"Chaitin, G.: On the length of programs for computing finite binary sequences. J. Assoc. Comput. Mach.\u00a013, 547\u2013569 (1966)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1109\/51.940049","volume":"20","author":"X. Chen","year":"2001","unstructured":"Chen, X., Kwong, S., Li, M.: A compression algorithm for DNA sequences. IEEE Engineering in Medicine and Biology Magazine\u00a020(4), 61\u201366 (2001)","journal-title":"IEEE Engineering in Medicine and Biology Magazine"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of Formal Languages","author":"C. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics on words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, pp. 329\u2013438. Springer, Heidelberg (1997)"},{"key":"25_CR6","first-page":"66","volume-title":"NATO Advanced Research Workshop on Combinatorial Algorithms on Words, 1984","author":"M. Crochemore","year":"1985","unstructured":"Crochemore, M.: Linear searching for a square in a word. In: Apostolico, A., Galil, Z. (eds.) NATO Advanced Research Workshop on Combinatorial Algorithms on Words, 1984, pp. 66\u201372. Springer, Berlin (1985)"},{"key":"25_CR7","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 interaction. Theoret. Comput. Sci.\u00a01, 59\u201375 (1975)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR8","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 complexities of square-free D0L-languages. Theoret. Comput. Sci.\u00a016, 25\u201332 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR9","first-page":"108","volume":"13","author":"A. Ehrenfeucht","year":"1981","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On the subword complexities of D0L-languages with a constant distribution. Theoret. Comput. Sci.\u00a013, 108\u2013113 (1981)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR10","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1051\/ita\/1982160403031","volume":"16","author":"A. Ehrenfeucht","year":"1982","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On the subword complexities of homomorphic images of languages. RAIRO Informatique Th\u00e9orique\u00a016, 303\u2013316 (1982)","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(83)90003-0","volume":"16","author":"A. Ehrenfeucht","year":"1982","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On the subword complexities of locally catenative D0L-languages. Information Processing Letters\u00a016, 7\u20139 (1982)","journal-title":"Information Processing Letters"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(83)90050-9","volume":"17","author":"A. Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Rozenberg, G.: On the subword complexities of m-free D0L-languages. Information Processing Letters\u00a017, 121\u2013124 (1983)","journal-title":"Information Processing Letters"},{"key":"25_CR13","unstructured":"Farach, M., Noordewier, M.O., Savari, S.A., Shepp, L.A., Wyner, A.D., Ziv, J.: On the entropy of DNA: algorithms and measurements based on memory and rapid convergence. In: Proc. of SODA 1995, pp. 48\u201357 (1995)"},{"issue":"1-3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0303-2647(93)90070-S","volume":"30","author":"V.D. Gusev","year":"1993","unstructured":"Gusev, V.D., Kulichkov, V.A., Chupakhina, O.M.: The Lempel-Ziv complexity and local structure analysis of genomes. Biosystems\u00a030(1-3), 183\u2013200 (1993)","journal-title":"Biosystems"},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1142\/S0129054104002297","volume":"15","author":"L. Ilie","year":"2004","unstructured":"Ilie, L., Yu, S., Zhang, K.: Word complexity and repetitions in words. Internat. J. Found. Comput. Sci.\u00a015(1), 41\u201355 (2004)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"25_CR16","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Probl. Inform. Transmission\u00a01, 1\u20137 (1965)","journal-title":"Probl. Inform. Transmission"},{"key":"25_CR17","first-page":"596","volume-title":"Proc. of the 40th Annual Symposium on Foundations of Computer Science","author":"R. Kolpakov","year":"1999","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proc. of the 40th Annual Symposium on Foundations of Computer Science, pp. 596\u2013604. IEEE Computer Soc., Los Alamitos (1999)"},{"issue":"1","key":"25_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"92","author":"A. Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the Complexity of Finite Sequences. IEEE Trans. Inform. Theory\u00a092(1), 75\u201381 (1976)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"#cr-split#-25_CR19.1","unstructured":"Lothaire, M.: Combinatorics on Words. Addison-Wesley, Reading (1983);"},{"key":"#cr-split#-25_CR19.2","unstructured":"Reprinted with corrections, Cambridge Univ. Press, Cambridge (1997)"},{"key":"25_CR20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"25_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M. Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, Cambridge (2005)"},{"issue":"1-2","key":"25_CR22","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0166-218X(89)90051-6","volume":"25","author":"M.G. Main","year":"1989","unstructured":"Main, M.G.: Detecting leftmost maximal periodicities. Discrete Appl. Math.\u00a025(1-2), 145\u2013153 (1989)","journal-title":"Discrete Appl. Math."},{"key":"25_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-12920-0_21","volume-title":"STACS 84","author":"J.-J. Pansiot","year":"1984","unstructured":"Pansiot, J.-J.: Bornes inf\u00e9rieures sur la complexit\u00e9 des facteurs des mots infinis engendr\u00e9s par morphismes it\u00e9r\u00e9s. In: Fontet, M., Mehlhorn, K. (eds.) STACS 1984. LNCS, vol.\u00a0166, pp. 230\u2013240. Springer, Heidelberg (1984)"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1007\/3-540-13345-3_34","volume-title":"Automata, Languages, and Programming","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)"},{"key":"25_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/3-540-10854-8_36","volume-title":"Fundamentals of Computation Theory","author":"G. Rozenberg","year":"1981","unstructured":"Rozenberg, G.: On subwords of formal languages. In: Gecseg, F. (ed.) FCT 1981. LNCS, vol.\u00a0117, pp. 328\u2013333. Springer, Heidelberg (1981)"},{"key":"25_CR26","volume-title":"The Mathematical Theory of L Systems","author":"G. Rozenberg","year":"1980","unstructured":"Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. Academic Press, London (1980)"},{"issue":"1-3","key":"25_CR27","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(02)00777-6","volume":"302","author":"W. Rytter","year":"2003","unstructured":"Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoret. Comput. Sci.\u00a0302(1-3), 211\u2013222 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR28","doi-asserted-by":"crossref","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)"},{"issue":"2","key":"25_CR29","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1088\/0954-898X\/14\/2\/309","volume":"14","author":"J. Szczepanski","year":"2003","unstructured":"Szczepanski, J., Amigo, M., Wajnryb, E., Sanchez-Vives, M.V.: Application of Lempel-Ziv complexity to the analysis of neural discharges. Network: Computation in Neural Systems\u00a014(2), 335\u2013350 (2003)","journal-title":"Network: Computation in Neural Systems"},{"key":"25_CR30","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.neucom.2004.01.026","volume":"58-60","author":"J. Szczepanski","year":"2004","unstructured":"Szczepanski, J., Amigo, J.M., Wajnryb, E., Sanchez-Vives, M.V.: Characterizing spike trains with Lempel-Ziv complexity. Neurocomputing\u00a058-60, 79\u201384 (2004)","journal-title":"Neurocomputing"},{"issue":"3","key":"25_CR31","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory\u00a023(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"25_CR32","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory\u00a024(5), 530\u2013536 (1978)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:30:36Z","timestamp":1619508636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/11821069_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}