{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:13:44Z","timestamp":1743102824175,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_10","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"134-145","source":"Crossref","is-referenced-by-count":1,"title":["The Average State Complexity of the Star of a Finite Set of Words Is Linear"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9rique","family":"Bassino","sequence":"first","affiliation":[]},{"given":"Laura","family":"Giambruno","sequence":"additional","affiliation":[]},{"given":"Cyril","family":"Nicaud","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Theory of Codes","author":"J. Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of Codes. Academic Press, London (1985)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/3-540-45526-4_6","volume-title":"Automata Implementation","author":"C. Campeanu","year":"2001","unstructured":"Campeanu, C., Culik, K., Salomaa, K., Yu, S.: State complexity of basic operations on finite languages. In: Boldt, O., J\u00fcrgensen, H. (eds.) WIA 1999. LNCS, vol.\u00a02214, pp. 60\u201370. Springer, Heidelberg (2001)"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-1-4471-0751-4_5","volume-title":"Finite Versus Infinite: Contributions to an Eternal Dilemma","author":"C. Campeanu","year":"2000","unstructured":"Campeanu, C., Salomaa, K., Yu, S.: State complexity of regular languages: finite versus infinite. In: Calude, C.S., Paun, G. (eds.) Finite Versus Infinite: Contributions to an Eternal Dilemma, pp. 53\u201373. Springer, Heidelberg (2000)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.tcs.2005.03.030","volume":"340","author":"J. Cl\u00e9ment","year":"2005","unstructured":"Cl\u00e9ment, J., Duval, J.-P., Guaiana, G., Perrin, D., Rindone, G.: Parsing with a finite dictionary. Theoretical Computer Science\u00a0340, 432\u2013442 (2005)","journal-title":"Theoretical Computer Science"},{"key":"10_CR5","first-page":"407","volume":"10","author":"K. Ellul","year":"2005","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.-W.: Regular expressions: new results and open problems. J. Autom. Lang. Combin.\u00a010, 407\u2013437 (2005)","journal-title":"J. Autom. Lang. Combin."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic combinatorics (in preparation, 2008), Version of January 2, 2008, \n                      http:\/\/www.algo.inria.fr\/flajolet\/publist.html","DOI":"10.1017\/CBO9780511801655"},{"key":"10_CR7","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, Reading (1979)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01300131","volume":"16","author":"J.L. Ramir\u00e9z-Alfons\u00edn","year":"1996","unstructured":"Ramir\u00e9z-Alfons\u00edn, J.L.: Complexity of the Frobenius problem. Combinatorica\u00a016, 143\u2013147 (1996)","journal-title":"Combinatorica"},{"key":"10_CR9","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198568209.001.0001","volume-title":"The Diophantine Frobenius Problem","author":"J.L. Ramir\u00e9z-Alfons\u00edn","year":"2005","unstructured":"Ramir\u00e9z-Alfons\u00edn, J.L.: The Diophantine Frobenius Problem. Oxford University Press, Oxford (2005)"},{"key":"10_CR10","unstructured":"Kao, J.-Y., Shallit, J., Xu, Z.: The Frobenius problem in a free monoid. In: Symposium on Theoretical Aspects of Computer Science 2008, Bordeaux, pp. 421\u2013432 (2008), \n                      www.stacs-cong.org"},{"key":"10_CR11","series-title":"Encyclopedia of mathematics and its applications","volume-title":"Combinatorics on words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on words. Encyclopedia of mathematics and its applications, vol.\u00a017. Addison-Wesley, Reading (1983)"},{"key":"10_CR12","series-title":"Encyclopedia of mathematics and its applications","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. Encyclopedia of mathematics and its applications, vol.\u00a090. Cambridge University Press, Cambridge (2002)"},{"key":"10_CR13","series-title":"Encyclopedia of mathematics and its applications","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. Encyclopedia of mathematics and its applications, vol.\u00a0104. Cambridge University Press, Cambridge (2005)"},{"key":"10_CR14","first-page":"1266","volume":"194","author":"A.N. Maslov","year":"1970","unstructured":"Maslov, A.N.: Estimates of the number of states of finite automata. Dokl. Akad. Nauk. SSRR\u00a0194, 1266\u20131268 (1970) (in Russian); English translation in. Soviet. Math. Dokl. 11, 1373\u20131375 (1970)","journal-title":"Dokl. Akad. Nauk. SSRR"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(92)00011-F","volume":"125","author":"S. Yu","year":"1994","unstructured":"Yu, S., Zhuang, Q., Salomaa, K.: The state complexities of some basic operations on regular languages. Theoretical Computer Science\u00a0125, 315\u2013328 (1994)","journal-title":"Theoretical Computer Science"}],"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-540-85780-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T22:09:05Z","timestamp":1675894145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}