{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T13:09:05Z","timestamp":1785416945779,"version":"3.56.0"},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2003,12]]},"abstract":"<jats:p> A deterministic finite automaton (DFA) [Formula: see text] is called a cover automaton (DFCA) for a finite language L over some alphabet \u03a3 if [Formula: see text], with l being the length of some longest word in L. Thus a word w \u2208 \u03a3* is in L if and only if |w| \u2264 l and [Formula: see text]. The DFCA [Formula: see text] is minimal if no DFCA for L has fewer states. <\/jats:p><jats:p> In this paper, we present an algorithm which converts an n\u2013state DFA for some finite language L into a corresponding minimal DFCA, using only O(n log n) time and O(n) space. The best previously known algorithm requires O(n<jats:sup>2<\/jats:sup>) time and space. Furthermore, the new algorithm can also be used to minimize any DFCA, where the best previous method takes O(n<jats:sup>4<\/jats:sup>) time and space. Since the required data structure is rather complex, an implementation in the common programming language C\/C++ is also provided. <\/jats:p>","DOI":"10.1142\/s0129054103002187","type":"journal-article","created":{"date-parts":[[2003,12,19]],"date-time":"2003-12-19T05:51:21Z","timestamp":1071813081000},"page":"1071-1086","source":"Crossref","is-referenced-by-count":24,"title":["A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA  FOR FINITE LANGUAGES"],"prefix":"10.1142","volume":"14","author":[{"given":"HEIKO","family":"K\u00d6RNER","sequence":"first","affiliation":[{"name":"Wallgasse 14,  D\u201367433 Neustadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054102000960"},{"key":"rf5","volume-title":"Introduction to Algorithms","author":"Corman T. H.","year":"1990"},{"key":"rf6","doi-asserted-by":"crossref","unstructured":"J. E.\u00a0Hopcroft, The Theory of Machines and Computations, eds. Z.\u00a0Kohavi and A.\u00a0Paz (Academic Press, New York, 1971)\u00a0pp. 189\u2013196.","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"rf7","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft J. E.","year":"1979"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054103002187","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:25:56Z","timestamp":1565191556000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054103002187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":4,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2003,12]]}},"alternative-id":["10.1142\/S0129054103002187"],"URL":"https:\/\/doi.org\/10.1142\/s0129054103002187","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}