{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:31:13Z","timestamp":1725492673386},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404316"},{"type":"electronic","value":"9783540450054"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45005-x_27","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T04:27:47Z","timestamp":1192768067000},"page":"307-318","source":"Crossref","is-referenced-by-count":1,"title":["The Average Lengths of the Factors of the Standard Factorization of Lyndon Words"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9rique","family":"Bassino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Cl\u00e9ment","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Nicaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"27_CR1","first-page":"139","volume":"63","author":"J. Berstel","year":"1997","unstructured":"J. Berstel and L. Boasson. The set of lyndon words is not context-free. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 63:139\u2013140, 1997.","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci. EATCS"},{"key":"27_CR2","unstructured":"J. Berstel and D. Perrin. Theory of codes. Academic Press, 1985."},{"issue":"1\u20132","key":"27_CR3","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/0304-3975(94)00013-1","volume":"132","author":"J. Berstel","year":"1994","unstructured":"J. Berstel and M. Pocchiola. Average cost of Duval\u2019s algorithm for generating Lyndon words. Theoret. Comput. Sci., 132(1\u20132):415\u2013425, 1994.","journal-title":"Theoret. Comput. Sci."},{"issue":"4\u20135","key":"27_CR4","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","volume":"10","author":"K. S. Booth","year":"1980","unstructured":"K. S. Booth. Lexicographically least circular substrings. Inform. Process. Lett., 10(4\u20135):240\u2013242, 1980.","journal-title":"Inform. Process. Lett."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/1970044","volume":"58","author":"K.T. Chen","year":"1958","unstructured":"K.T. Chen, R.H. Fox, and R.C. Lyndon. Free differential calculus IV: The quotient groups of the lower central series. Ann. Math., 58:81\u201395, 1958.","journal-title":"Ann. Math."},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0196-6774(83)90017-2","volume":"4","author":"J.-P. Duval","year":"1983","unstructured":"J.-P. Duval. Factorizing words over an ordered alphabet. Journal of Algorithms, 4:363\u2013381, 1983.","journal-title":"Journal of Algorithms"},{"key":"27_CR7","first-page":"363","volume":"4","author":"J.-P. Duval","year":"1988","unstructured":"J.-P. Duval. G\u00e9n\u00e9ration d\u2019une section des classes de conjugaison et arbre des mots de Lyndon de longueur born\u00e9e. Theoret. Comput. Sci., 4:363\u2013381, 1988.","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1006\/jagm.2001.1158","volume":"40","author":"P. Flajolet","year":"2001","unstructured":"P. Flajolet, X. Gourdon, and D. Panario. The complete analysis of a polynomial factorization algorithm over finite fields. Journal of Algorithms, 40:37\u201381, 2001.","journal-title":"Journal of Algorithms"},{"key":"27_CR9","unstructured":"P. Flajolet and R. Sedgewick. Analytic combinatorics-symbolic combinatorics. Book in preparation, 2002. (Individual chapters are available as INRIA Research reports at \n                    http:\/\/www.algo.inria.fr\/.ajolet\/publist.html\n                    \n                  )."},{"key":"27_CR10","unstructured":"S. Golomb. Irreducible polynomials, synchronizing codes, primitive necklaces and cyclotomic algebra. In Proc. Conf Combinatorial Math. and Its Appl., pages 358\u2013370, Chapel Hill, 1969. Univ. of North Carolina Press."},{"key":"27_CR11","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/1385-7258(78)90041-0","volume":"40","author":"D. E. Knuth","year":"1978","unstructured":"D. E. Knuth. The average time for carry propagation. Indagationes Mathematicae, 40:238\u2013242, 1978.","journal-title":"Indagationes Mathematicae"},{"key":"27_CR12","unstructured":"M. Lothaire. Combinatorics on Words, volume 17 of Encyclopedia of mathematics and its applications. Addison-Wesley, 1983."},{"key":"27_CR13","unstructured":"M. Lothaire. Applied Combinatorics on Words. Cambridge University Press, 2003. in preparation, chapters available at \n                    http:\/\/www-igm.univ-mlv.fr\/~berstel\/Lothaire\n                    \n                  ."},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"202","DOI":"10.2307\/1990868","volume":"77","author":"R. C. Lyndon","year":"1954","unstructured":"R. C. Lyndon. On Burnside problem I. Trans. American Math. Soc., 77:202\u2013215, 1954.","journal-title":"Trans. American Math. Soc."},{"key":"27_CR15","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF02679619","volume":"29","author":"D. Panario","year":"2001","unstructured":"D. Panario and B. Richmond. Smallest components in decomposable structures: exp-log class. Algorithmica, 29:205\u2013226, 2001.","journal-title":"Algorithmica"},{"key":"27_CR16","unstructured":"C. Reutenauer. Free Lie algebras. Oxford University Press, 1993."},{"key":"27_CR17","unstructured":"F. Ruskey and J. Sawada. Generating Lyndon brackets: a basis for the th homogeneous component of the free Lie algebra. Journal of Algorithms, (to appear). Available at \n                    http:\/\/www.cs.uvic.ca\/ fruskey\/Publications\/\n                    \n                  ."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45005-X_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T04:35:12Z","timestamp":1550982912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45005-X_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404316","9783540450054"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45005-x_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}