{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:25Z","timestamp":1725491425172},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_12","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T05:32:31Z","timestamp":1155101551000},"page":"114-125","source":"Crossref","is-referenced-by-count":6,"title":["Around Hopcroft\u2019s Algorithm"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Baclet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claire","family":"Pagetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Beauquier, D., Berstel, J., Chr\u00e9tienne, P.: \u00c9l\u00e9ments d\u2019Algorithmique, Masson (1992)"},{"key":"12_CR2","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":"12_CR3","doi-asserted-by":"crossref","unstructured":"Baclet, M., Pagetti, C.: Around Hopcroft\u2019s Algorithm. Technical Report LSV-06-12, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS de Cachan, France (2006)","DOI":"10.1007\/11812128_12"},{"key":"12_CR4","unstructured":"Baclet, M., Pacalet, R., Petit, A.: Register transfer level simulation. Technical Report LSV-04-10, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS de Cachan, France (2004)"},{"key":"12_CR5","series-title":"MRI Symposia Series","first-page":"529","volume-title":"Mathematical Theory of Automata","author":"J.A. Brzozowski","year":"1962","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Mathematical Theory of Automata. MRI Symposia Series, vol.\u00a012, pp. 529\u2013561. Polytechnic Press, New York (1962)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-540-30500-2_30","volume-title":"Implementation and Application of Automata","author":"J.-M. Couvreur","year":"2005","unstructured":"Couvreur, J.-M.: A BDD-like implementation of an automata package. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 310\u2013311. Springer, Heidelberg (2005)"},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"The Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing the states in a finite automaton. In: Kohavi, Z. (ed.) The Theory of Machines and Computations, pp. 189\u2013196. Academic Press, London (1971)"},{"key":"12_CR8","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, Reading (1979)"},{"key":"12_CR9","unstructured":"Klarlund, N., M\u00f8ller, A.: MONA Version 1.4 User Manual. BRICS Notes Series NS-01-1, Department of Computer Science, University of Aarhus (January 2001)"},{"issue":"1-2","key":"12_CR10","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. Theoretical Computer Science\u00a0250(1-2), 333\u2013363 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(99)00014-6","volume":"231","author":"M. Mohri","year":"2000","unstructured":"Mohri, M., Pereira, F., Riley, M.: The design principles of a weighted finite-state transducer library. Theoretical Computer Science\u00a0231(1), 17\u201332 (2000)","journal-title":"Theoretical Computer Science"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformation. Proc. American Mathematical Society\u00a09, 541\u2013544 (1958)","journal-title":"Proc. American Mathematical Society"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","volume":"40","author":"R. Paige","year":"1985","unstructured":"Paige, R., Tarjan, R.E., Bonic, R.: A linear time solution to the single function coarsest partition problem. Theoretical Computer Science\u00a040, 67\u201384 (1985)","journal-title":"Theoretical Computer Science"},{"key":"12_CR14","unstructured":"Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. PhD thesis, Eindhoven University of Technology, the Netherlands (1995)"},{"key":"12_CR15","unstructured":"Watson, B.W.: An incremental DFA minimization algorithm. In: Proc. 3rd International Workshop on Finite-State Methods and Natural Language Processing (FSMNLP 2001) (2001)"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1017\/S1351324903003127","volume":"9","author":"B.W. Watson","year":"2003","unstructured":"Watson, B.W., Daciuk, J.: An efficient incremental DFA minimization algorithm. Natural Language Engineering\u00a09(1), 49\u201364 (2003)","journal-title":"Natural Language Engineering"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:19:59Z","timestamp":1558271999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11812128_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}