{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:15:29Z","timestamp":1676470529110},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2010,8]]},"abstract":"<jats:p> Considering the uniform distribution on sets of m non-empty words whose sum of lengths is n, we establish that the average state complexities of the rational operations are asymptotically linear. <\/jats:p>","DOI":"10.1142\/s0129054110007398","type":"journal-article","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T06:29:32Z","timestamp":1281421772000},"page":"495-516","source":"Crossref","is-referenced-by-count":5,"title":["THE AVERAGE STATE COMPLEXITY OF RATIONAL OPERATIONS ON FINITE LANGUAGES"],"prefix":"10.1142","volume":"21","author":[{"given":"FR\u00c9D\u00c9RIQUE","family":"BASSINO","sequence":"first","affiliation":[{"name":"LIPN UMR CNRS 7030, Universit\u00e9 Paris 13, 93430 Villetaneuse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LAURA","family":"GIAMBRUNO","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica e Applicazioni, Universit\u00e0di Palermo, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CYRIL","family":"NICAUD","sequence":"additional","affiliation":[{"name":"LIGM UMR CNRS 8049, Universit\u00e9 Paris-Est, 77454 Marne-la-Vall\u00e9e, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","volume-title":"Theory of Codes","author":"Berstel J.","year":"1985"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0751-4_5"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.030"},{"key":"rf6","first-page":"407","volume":"10","author":"Ellul K.","journal-title":"J. Autom. Lang. Combin."},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.07.035"},{"key":"rf9","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft J. E.","year":"1979"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01300131"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198568209.001.0001"},{"key":"rf13","series-title":"Encyclopedia of mathematics and its applications","volume-title":"Combinatorics on Words","volume":"17","author":"Lothaire M.","year":"1983"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)00011-F"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054110007398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:32:19Z","timestamp":1565123539000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054110007398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8]]},"references-count":13,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2010,8]]}},"alternative-id":["10.1142\/S0129054110007398"],"URL":"https:\/\/doi.org\/10.1142\/s0129054110007398","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8]]}}}