{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:18:01Z","timestamp":1725596281412},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222559"},{"type":"electronic","value":"9783642222566"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22256-6_19","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T17:37:04Z","timestamp":1311010624000},"page":"203-214","source":"Crossref","is-referenced-by-count":1,"title":["Computing All \u2113-Cover Automata Fast"],"prefix":"10.1007","author":[{"given":"Artur","family":"Je\u017c","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Maletti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1051\/ita:2007061","volume":"43","author":"A. Badr","year":"2009","unstructured":"Badr, A., Geffert, V., Shipman, I.: Hyper-minimizing minimized deterministic finite state automata. RAIRO Theoret. Inform. Appl.\u00a043(1), 69\u201394 (2009)","journal-title":"RAIRO Theoret. Inform. Appl."},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1142\/S0129054102000960","volume":"13","author":"C. C\u00e2mpeanu","year":"2002","unstructured":"C\u00e2mpeanu, C., Paun, A., Yu, S.: An efficient algorithm for constructing minimal cover automata for finite languages. Int. J. Found. Comput. Sci.\u00a013(1), 83\u201397 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1-2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00292-9","volume":"267","author":"C. C\u00e2mpeanu","year":"2001","unstructured":"C\u00e2mpeanu, C., Santean, N., Yu, S.: Minimal cover-automata for finite languages. Theor. Comput. Sci.\u00a0267(1-2), 3\u201316 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1051\/ita:2005006","volume":"39","author":"J.-M. Champarnaud","year":"2005","unstructured":"Champarnaud, J.-M., Guingne, F., Hansel, G.: Similarity relations and cover automata. RAIRO Theoret. Inform. Appl.\u00a039(1), 115\u2013123 (2005)","journal-title":"RAIRO Theoret. Inform. Appl."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-03816-7_31","volume-title":"Mathematical Foundations of Computer Science 2009","author":"P. Gawrychowski","year":"2009","unstructured":"Gawrychowski, P., Je\u017c, A.: Hyper-minimisation made efficient. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 356\u2013368. Springer, Heidelberg (2009)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Gawrychowski, P., Je\u017c, A., Maletti, A.: On minimising automata with errors. Corr. abs\/1102.5682 (2011)","DOI":"10.1007\/978-3-642-22993-0_31"},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF00264025","volume":"2","author":"D. Gries","year":"1973","unstructured":"Gries, D.: Describing an algorithm by Hopcroft. Acta Inf.\u00a02(2), 97\u2013109 (1973)","journal-title":"Acta Inf."},{"issue":"320","key":"19_CR8","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1080\/01621459.1967.10500922","volume":"62","author":"J.A. Hartigan","year":"1967","unstructured":"Hartigan, J.A.: Representation of similarity matrices by trees. J. Amer. Statist. Assoc.\u00a062(320), 1140\u20131158 (1967)","journal-title":"J. Amer. Statist. Assoc."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An $n\\,\\textrm{log}\\, n$ algorithm for minimizing states in a finite automaton. In: Kohavi, Z. (ed.) Theory of Machines and Computations, pp. 189\u2013196. Academic Press, London (1971)"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0025-5564(67)90032-6","volume":"1","author":"C.J. Jardine","year":"1967","unstructured":"Jardine, C.J., Jardine, N., Sibson, R.: The structure and construction of taxonomic hierarchies. Math. Biosci.\u00a01(2), 173\u2013179 (1967)","journal-title":"Math. Biosci."},{"issue":"3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02289588","volume":"32","author":"S.C. Johnson","year":"1967","unstructured":"Johnson, S.C.: Hierarchical clustering schemes. Psychometrika\u00a032(3), 241\u2013254 (1967)","journal-title":"Psychometrika"},{"issue":"6","key":"19_CR12","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1142\/S0129054103002187","volume":"14","author":"H. K\u00f6rner","year":"2003","unstructured":"K\u00f6rner, H.: A time and space efficient algorithm for minimizing cover automata for finite languages. Int. J. Found. Comput. Sci.\u00a014(6), 1071\u20131086 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"19_CR13","unstructured":"Schewe, S.: Beyond hyper-minimisation \u2014 Minimising DBAs and DPAs is NP-complete. In: Proc. Ann. Conf. Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol.\u00a08, pp. 400\u2013411. Schloss Dagstuhl (2010)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22256-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T02:30:42Z","timestamp":1560393042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22256-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222559","9783642222566"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22256-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}