{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:24:17Z","timestamp":1760189057655},"reference-count":22,"publisher":"Elsevier BV","issue":"24-25","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":1574,"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":[[2009,5]]},"DOI":"10.1016\/j.tcs.2009.02.034","type":"journal-article","created":{"date-parts":[[2009,3,6]],"date-time":"2009-03-06T10:49:51Z","timestamp":1236336591000},"page":"2424-2430","source":"Crossref","is-referenced-by-count":9,"title":["On the Hopcroft\u2019s minimization technique for DFA and DFCA"],"prefix":"10.1016","volume":"410","author":[{"given":"Andrei","family":"P\u0103un","sequence":"first","affiliation":[]},{"given":"Mihaela","family":"P\u0103un","sequence":"additional","affiliation":[]},{"given":"Alfonso","family":"Rodr\u00edguez-Pat\u00f3n","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2009.02.034_b1","series-title":"Proc. of the 11th Conference on Implementation and Application of Automata","first-page":"114","article-title":"Around Hopcroft\u2019s algorithm","volume":"vol. 4094","author":"Baclet","year":"2006"},{"key":"10.1016\/j.tcs.2009.02.034_b2","series-title":"Proc. 9th Conference on Implementation and Application of Automata","first-page":"35","article-title":"On the complexity of Hopcrofts state minimization algorithm","volume":"vol. 3317","author":"Berstel","year":"2004"},{"key":"10.1016\/j.tcs.2009.02.034_b3","first-page":"758","article-title":"A combinatorial problem","volume":"49","author":"de Bruijn","year":"1946","journal-title":"Koninklijke Nederlandse Akademie v. Wetenschappen"},{"issue":"1","key":"10.1016\/j.tcs.2009.02.034_b4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1142\/S0129054102000960","article-title":"An efficient algorithm for constructing minimal cover automata for finite languages","volume":"13","author":"C\u00e2mpeanu","year":"2002","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3","key":"10.1016\/j.tcs.2009.02.034_b5","first-page":"303","article-title":"Tight lower bound for the state complexity of shuffle of regular languages","volume":"7","author":"C\u00e2mpeanu","year":"2002","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"10.1016\/j.tcs.2009.02.034_b6","series-title":"Proceedings of the Third International Workshop on Implementing Automata, WIA\u201998","first-page":"32","article-title":"Minimal cover-automata for finite languages","author":"C\u00e2mpeanu","year":"1998"},{"key":"10.1016\/j.tcs.2009.02.034_b7","series-title":"Proceedings of Developments in Language Theory 2001","first-page":"319","article-title":"Minimal covers of formal languages","volume":"vol. 2295","author":"Domaratzki","year":"2002"},{"key":"10.1016\/j.tcs.2009.02.034_b8","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 Informatica"},{"key":"10.1016\/j.tcs.2009.02.034_b9","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"2001"},{"key":"10.1016\/j.tcs.2009.02.034_b10","series-title":"Theory of Machines and Computations","first-page":"189","article-title":"An nlogn algorithm for minimizing states in a finite automaton","author":"Hopcroft","year":"1971"},{"issue":"1","key":"10.1016\/j.tcs.2009.02.034_b11","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/S0890-5401(03)00090-7","article-title":"Follow automata","volume":"186","author":"Ilie","year":"2003","journal-title":"Information and Computation"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2009.02.034_b12","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0304-3975(99)00150-4","article-title":"Re-describing an algorithm by Hopcroft","volume":"250","author":"Knuutila","year":"2001","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"10.1016\/j.tcs.2009.02.034_b13","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1142\/S0129054103002187","article-title":"A time and space efficient algorithm for minimizing cover automata for finite languages","volume":"14","author":"K\u00f6rner","year":"2003","journal-title":"International Journal of Foundations of Computer Science"},{"key":"10.1016\/j.tcs.2009.02.034_b14","series-title":"CIAA 2000","first-page":"243","article-title":"An O(n2) algorithm for constructing minimal cover automata for finite languages","volume":"vol. 2088","author":"P\u0103un","year":"2001"},{"key":"10.1016\/j.tcs.2009.02.034_b15","series-title":"Formal Languages","author":"Salomaa","year":"1973"},{"issue":"1","key":"10.1016\/j.tcs.2009.02.034_b16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0304-3975(99)00020-1","article-title":"Efficient implementation of regular languages using reversed alternating finite automata","volume":"231","author":"Salomaa","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2009.02.034_b17","unstructured":"N. S\u00e2ntean, Towards a minimal representation for finite languages: Theory and practice, MSc Thesis, Department of Computer Science, The University of Western Ontario, 2000"},{"key":"10.1016\/j.tcs.2009.02.034_b18","series-title":"Handbook of Formal Languages","first-page":"41","article-title":"Regular Languages","author":"Yu","year":"1998"},{"key":"10.1016\/j.tcs.2009.02.034_b19","first-page":"142","article-title":"State complexity of finite and infinite regular languages","volume":"76","author":"Yu","year":"2002","journal-title":"Bulletin of the EATCS"},{"issue":"1\u20134","key":"10.1016\/j.tcs.2009.02.034_b20","first-page":"471","article-title":"State complexity: Recent Results and open problems","volume":"64","author":"Yu","year":"2005","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/j.tcs.2009.02.034_b21","series-title":"CIAA 2006","first-page":"11","article-title":"On the state complexity of combined operations","volume":"vol. 4094","author":"Yu","year":"2006"},{"key":"10.1016\/j.tcs.2009.02.034_b22","unstructured":"The Grail + Project. A symbolic computation environment for finite state machines, regular expressions, and finite languages, available online at the following address: http:\/\/www.csd.uwo.ca\/research\/grail\/"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397509001868?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397509001868?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T06:56:28Z","timestamp":1545375388000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397509001868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":22,"journal-issue":{"issue":"24-25","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["S0304397509001868"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2009.02.034","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}