{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:19Z","timestamp":1725549199169},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243182"},{"type":"electronic","value":"9783540305002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_4","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"35-44","source":"Crossref","is-referenced-by-count":17,"title":["On the Complexity of Hopcroft\u2019s State Minimization Algorithm"],"prefix":"10.1007","author":[{"given":"Jean","family":"Berstel","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Carton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"Formal Languages and their Relation to Automata","author":"J.E. Hopcroft","year":"1969","unstructured":"Hopcroft, J.E., Ullman, J.D.: Formal Languages and their Relation to Automata. Addison-Wesley, Reading (1969)"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. In: Kohavi, Z., Paz, A. (eds.) Theory of Machines and Computations, pp. 189\u2013196. Academic Press, London (1971)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/BF01068312","volume":"27","author":"S.L. Krivol","year":"1991","unstructured":"Krivol, S.L.: Algorithms for minimization of finite acyclic automata and pattern matching in terms. Cybernetics\u00a027, 324\u2013331 (1991); Translated from Kibernetika 3, 11\u201316 (May-June 1991)","journal-title":"Cybernetics"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","volume":"92","author":"D. Revuz","year":"1992","unstructured":"Revuz, D.: Minimisation of acyclic deterministic automata in linear time. Theoret. Comput. Sci.\u00a092, 181\u2013189 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-44977-9_26","volume-title":"Implementation and Application of Automata","author":"J. Daciuk","year":"2003","unstructured":"Daciuk, J.: Comparison of construction algorithms for minimal, acyclic, deterministic finite-state automata from sets of strings. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 255\u2013261. Springer, Heidelberg (2003)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(82)90016-0","volume":"19","author":"A. Cardon","year":"1982","unstructured":"Cardon, A., Crochemore, M.: Partitioning a graph in O(|A| log2 |V |). Theoret. Comput. Sci.\u00a019, 85\u201398 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR7","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 for the single function coarsest partition problem. Theoret. Comput. Sci.\u00a040, 67\u201384 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"18","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput.\u00a018, 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"4_CR9","unstructured":"Gai, A.T.: Algorithmes de partionnement : minimisation d\u2019automates et applications aux graphes. M\u00e9moire de DEA, Universit\u00e9 Montpellier II (2003)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF00264025","volume":"2","author":"D. Gries","year":"1973","unstructured":"Gries, D.: Describing an algorithm by Hopcroft. Acta Inform.\u00a02, 97\u2013109 (1973)","journal-title":"Acta Inform."},{"key":"4_CR11","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"4_CR12","unstructured":"Beauquier, D., Berstel, J., Chr\u00e9tienne, P.: \u00c9l\u00e9ments d\u2019algorithmique. Masson (1992)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0020-0190(95)00199-9","volume":"57","author":"N. Blum","year":"1996","unstructured":"Blum, N.: A O(n log n) implementation of the standard method for minimizing n-state finite automata. Inform. Proc. Letters\u00a057, 65\u201369 (1996)","journal-title":"Inform. Proc. Letters"},{"key":"4_CR14","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. Theoret. Comput. Sci.\u00a0250, 333\u2013363 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR15","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Graph Theory","author":"W.T. Tutte","year":"1984","unstructured":"Tutte, W.T.: Graph Theory. Encyclopedia of Mathematics and its Applications, vol.\u00a021. Addison-Wesley, Reading (1984)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30500-2_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:21Z","timestamp":1605761841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}