{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:38Z","timestamp":1759638938153},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403913"},{"type":"electronic","value":"9783540449775"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_11","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:20:28Z","timestamp":1192544428000},"page":"117-127","source":"Crossref","is-referenced-by-count":5,"title":["On Minimizing Cover Automata for Finite Languages in O(n log n) Time"],"prefix":"10.1007","author":[{"given":"Heiko","family":"K\u00f6rner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"11_CR1","series-title":"Lect Notes Comput Sci","first-page":"32","volume-title":"Minimal Cover-Automata for Finite Languages","author":"C. C\u00e2mpeanu","year":"1998","unstructured":"C\u00e2mpeanu, C., S\u00e2ntean, N., Yu, S.: Minimal Cover-Automata for Finite Languages. In: Champarnaud, J.-M., Maurel, D., Ziadi, D. (eds.): Third International Workshop on Implementing Automata (WIA\u201998). Lecture Notes in Computer Science, Vol. 1660. Springer-Verlag, Berlin Heidelberg New York (1998) 32\u201342"},{"key":"11_CR2","unstructured":"C\u00e2mpeanu, C., P\u0103un, A., Yu, S.: An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. International Journal of Foundations of Computer Science (2000), to appear"},{"key":"11_CR3","series-title":"Lect Notes Comput Sci","first-page":"243","volume-title":"An O(n 2) Algorithm for Constructing Minimal Cover Automata for Finite Languages","author":"A. P\u0103un","year":"2000","unstructured":"P\u0103un, A., S\u00e2ntean, N., Yu, S.: An O(n\n                           2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. In: Yu, S., P\u0103un, A. (eds.): Implementation and Application of Automata (CIAA 2000). Lecture Notes in Computer Science, Vol. 2088. Springer-Verlag, Berlin Heidelberg New York (2000) 243\u2013251"},{"key":"11_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Corman","year":"1990","unstructured":"Corman, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"The Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing the states in a finite automaton. In: Kohavi, Z., Paz. A. (eds.): The Theory of Machines and Computations. Academic Press, New York (1971) 189\u2013196"},{"key":"11_CR6","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, MA (1979)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T07:11:08Z","timestamp":1550992268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}