{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T10:16:23Z","timestamp":1777371383056,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":7868,"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":[[1992,1]]},"DOI":"10.1016\/0304-3975(92)90142-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"181-189","source":"Crossref","is-referenced-by-count":97,"title":["Minimisation of acyclic deterministic automata in linear time"],"prefix":"10.1016","volume":"92","author":[{"given":"Dominique","family":"Revuz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90142-3_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(92)90142-3_BIB2","series-title":"Compilers, Principles, Techniques and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/0304-3975(92)90142-3_BIB3","doi-asserted-by":"crossref","unstructured":"R.E. Bryant, Graph-based algorithms for boolean function manipulation, IEEE Trans. on Computers, C-35, (5) 677\u2013691.","DOI":"10.1109\/TC.1986.1676819"},{"key":"10.1016\/0304-3975(92)90142-3_BIB4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(82)90016-0","article-title":"Partitioning a graph in O(\u2223A\u2223log2\u2223V\u2223)","volume":"19","author":"Cardon","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90142-3_BIB5_1","series-title":"TR-71-114","article-title":"An algorithm for testing equivalence of finite automata","author":"Hopcroft","year":"1971"},{"key":"10.1016\/0304-3975(92)90142-3_BIB5_2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(92)90142-3_BIB6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0016-0032(54)90618-3","article-title":"The synthesis of sequential switching machines","volume":"257","author":"Huffman","year":"1954","journal-title":"J. Franklin Inst."},{"key":"10.1016\/0304-3975(92)90142-3_BIB7","series-title":"Compilation, Finite and Infinite Machines","author":"Minsky","year":"1967"},{"key":"10.1016\/0304-3975(92)90142-3_BIB8","series-title":"Gedanken Experiments on Sequential Machines: Automata studies","first-page":"129","author":"Moore","year":"1956"},{"issue":"6","key":"10.1016\/0304-3975(92)90142-3_BIB9","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."},{"key":"10.1016\/0304-3975(92)90142-3_BIB10","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Develop."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901423?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901423?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:56:29Z","timestamp":1555127789000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592901423"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0304397592901423"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90142-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}