{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:46:58Z","timestamp":1749124018803},"reference-count":24,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4580,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s0304-3975(99)00150-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:32:20Z","timestamp":1027607540000},"page":"333-363","source":"Crossref","is-referenced-by-count":42,"title":["Re-describing an algorithm by Hopcroft"],"prefix":"10.1016","volume":"250","author":[{"given":"Timo","family":"Knuutila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00150-4_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"2","key":"10.1016\/S0304-3975(99)00150-4_BIB2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(95)00199-9","article-title":"An O(nlog n) implementation of the standard method for minimizing n-state finite automata","volume":"57","author":"Blum","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00150-4_BIB3","doi-asserted-by":"crossref","unstructured":"W. Brauer, Automatentheorie, B. G. Teubner, Stuttgart, 1984.","DOI":"10.1007\/978-3-322-92151-2"},{"key":"10.1016\/S0304-3975(99)00150-4_BIB4","series-title":"Finite Automata, Their Algebras and Grammars","author":"B\u00fcchi","year":"1989"},{"key":"10.1016\/S0304-3975(99)00150-4_BIB5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(82)90016-0","article-title":"Partitioning a graph in O(|A|log |V|)","volume":"19","author":"Cardon","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00150-4_BIB6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0747-7171(08)80125-3","article-title":"Automate, a computing package for automata and finite semigroups","volume":"12","author":"Champarnaud","year":"1991","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(99)00150-4_BIB7","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0304-3975(99)00150-4_BIB8","series-title":"Tree Automata","author":"G\u00e9cseg","year":"1984"},{"key":"10.1016\/S0304-3975(99)00150-4_BIB9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF00264025","article-title":"Describing an algorithm by Hopcroft","volume":"2","author":"Gries","year":"1973","journal-title":"Acta Inform."},{"issue":"1","key":"10.1016\/S0304-3975(99)00150-4_BIB10","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","article-title":"Quicksort","volume":"5","author":"Hoare","year":"1962","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(99)00150-4_BIB11","doi-asserted-by":"crossref","unstructured":"J. Hopcroft, An nlog n algorithm for minimizing states in a finite automaton, Technical Report CS-190, Stanford University, 1970.","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"10.1016\/S0304-3975(99)00150-4_BIB12","series-title":"Proc. Internat. Symp. on the Theory of Machines and Computations, Haifa, Israel","first-page":"189","article-title":"An nlog n algorithm for minimizing states in a finite automaton","author":"Hopcroft","year":"1971"},{"key":"10.1016\/S0304-3975(99)00150-4_BIB13","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(99)00150-4_BIB14","unstructured":"O. Matz, A. Miller, A. Potthoff, W. Thomas, E. Valkema, Report on the program AMoRE, Technical Report 9507, Inst. f. Informatik u. Prakt. Math., CAU Kiel, 1995."},{"key":"10.1016\/S0304-3975(99)00150-4_BIB15","unstructured":"B. Mikolajczak (Ed.), Algebraic and Structural Automata Theory, Annals of Discrete Mathematics, vol. 44, North-Holland, Amsterdam, 1991."},{"issue":"6","key":"10.1016\/S0304-3975(99)00150-4_BIB16","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0304-3975(99)00150-4_BIB17","first-page":"67","article-title":"A linear time solution for the single function coarsest partition problem","volume":"40","author":"Paige","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(99)00150-4_BIB18","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1006\/jsco.1994.1023","article-title":"Grail","volume":"17","author":"Raymond","year":"1994","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(99)00150-4_BIB19","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","article-title":"Minimization of acylic deterministic automata in linear time","volume":"92","author":"Revuz","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00150-4_BIB20","series-title":"Theory of Automata","author":"Salomaa","year":"1969"},{"issue":"10","key":"10.1016\/S0304-3975(99)00150-4_BIB21","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1145\/359619.359631","article-title":"Implementing quicksort programs","volume":"21","author":"Sedgewick","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(99)00150-4_BIB22","first-page":"347","article-title":"Implementing finite state machines","volume":"vol. 15","author":"Sutner","year":"1994"},{"key":"10.1016\/S0304-3975(99)00150-4_BIB23","unstructured":"B. Watson, The design and implementation of the FIRE engine, Technical Report Computer Science Note 94\/22, Eindhoven University of Technology, Faculty of Mathematics and Computing Science, 1994."},{"key":"10.1016\/S0304-3975(99)00150-4_BIB24","unstructured":"B. Watson, A taxonomy of finite automata minimization algorithms, Technical Report Computer Science Note 93\/44, Eindhoven University of Technology, Faculty of Mathematics and Computing Science, 1994."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001504?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001504?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T11:57:37Z","timestamp":1578571057000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0304397599001504"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00150-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}