{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:01:54Z","timestamp":1725562914167},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_29","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"318-329","source":"Crossref","is-referenced-by-count":4,"title":["The Average Complexity of Moore\u2019s State Minimization Algorithm Is O( n loglogn)"],"prefix":"10.1007","author":[{"given":"Julien","family":"David","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Bassino, F., David, J., Nicaud, C.: On the average complexity of Moore\u2019s state minimization algorithm. In: Albers, S., Marion, J.-Y. (eds.) 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Freiburg, Germany. LIPIcs, vol.\u00a03, pp. 123\u2013134. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2009)"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2007.04.001","volume":"381","author":"F. Bassino","year":"2007","unstructured":"Bassino, F., Nicaud, C.: Enumeration and random generation of accessible automata. Theor. Comput. Sci.\u00a0381, 86\u2013104 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-30500-2_4","volume-title":"Implementation and Application of Automata","author":"J. Berstel","year":"2005","unstructured":"Berstel, J., Carton, O.: On the complexity of Hopcroft\u2019s state minimization algorithm. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 35\u201344. Springer, Heidelberg (2005)"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-02979-0_5","volume-title":"Implementation and Application of Automata","author":"G. Castiglione","year":"2009","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: On extremal cases of Hopcroft\u2019s algorithm. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol.\u00a05642, pp. 14\u201323. Springer, Heidelberg (2009)"},{"key":"29_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF00264025","volume":"2","author":"D. Gries","year":"1973","unstructured":"Gries, D.: Describing an algorithm by Hopcroft. Acta Inf.\u00a02, 97\u2013109 (1973)","journal-title":"Acta Inf."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. Technical report, Stanford University, Stanford, CA, USA (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"issue":"1-2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/S0304-3975(99)00150-4","volume":"250","author":"T. Knuutila","year":"2001","unstructured":"Knuutila, T.: Re-describing an algorithm by Hopcroft. Theor. Comput. Sci.\u00a0250(1-2), 333\u2013363 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Moore, E.F.: Gedanken experiments on sequential machines. Automata Studies, pp. 129\u2013153. Princeton U. (1956)","DOI":"10.1515\/9781400882618-006"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Nerode, A.: Linear automaton transformation. In: Proc. American Mathematical Society, pp. 541\u2013544 (1958)","DOI":"10.1090\/S0002-9939-1958-0135681-9"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:39Z","timestamp":1606186899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}