{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:23Z","timestamp":1725545063066},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_8","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"90-103","source":"Crossref","is-referenced-by-count":0,"title":["An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata"],"prefix":"10.1007","author":[{"given":"Cezar","family":"C\u00e2mpeanu","sequence":"first","affiliation":[]},{"given":"Andrei","family":"P\u0103un","sequence":"additional","affiliation":[]},{"given":"Jason R.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1162\/089120102760173652","volume":"28","author":"R.C. Carrasco","year":"2002","unstructured":"Carrasco, R.C., Forcada, M.L.: Incremental construction and maintenence of minimal finite-state automata. Computational Linguistics\u00a028(2), 207\u2013216 (2002)","journal-title":"Computational Linguistics"},{"issue":"1","key":"8_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/089120100561601","volume":"26","author":"J. Daciuk","year":"2000","unstructured":"Daciuk, J., Mihov, S., Watson, B., Watson, R.E.: Incremental construction of minimal acyclic finite state automata. Computational Linguistics\u00a026(1), 3\u201316 (2000)","journal-title":"Computational Linguistics"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-44977-9_26","volume-title":"Implementation and Application of Automata","author":"J. Daciuk","year":"2003","unstructured":"Daciuk, J.: Comparison of construction algorithms for minimal, acyclic, deterministic, finite-state automata from sets of strings. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 255\u2013261. Springer, Heidelberg (2003)"},{"key":"8_CR4","unstructured":"Mihov, S.: Direct construction of minimal acyclic finite states automata. Ann. de l\u2019Universit\u00e9 de Sofia \u201cSt. Kl. Ohridski\u201d, Facult\u00e9 de Mathematique et Informatique, Sofia, Bulgaria\u00a092(2) (1998)"},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0304-3975(02)00571-6","volume":"301 1","author":"K.N. Sgarbas","year":"2003","unstructured":"Sgarbas, K.N., Fakotakis, N.D., Kokkinakis, G.K.: Optimal insertion in deterministic DAWGs. Theoretical Computer Science\u00a0301 1(3), 103\u2013117 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1142\/S0218213095000188","volume":"4","author":"K.N. Sgarbas","year":"1995","unstructured":"Sgarbas, K.N., Fakotakis, N.D., Kokkinakis, G.K.: Two algorithms for incremental construction of directed acyclic word graphs. International Journal on Artificial Intelligence Tools\u00a04(3), 369\u2013381 (1995)","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"8_CR7","unstructured":"Watson, B.W.: A taxonomy of finite automata minimization algorithms. Eindhoven University of Technology, The Netherlands, Computing Science Note 93(44) (1993)"},{"key":"8_CR8","unstructured":"Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. Ph.D. thesis, Eindhoven University of Technology, the Netherlands (1995)"},{"key":"8_CR9","unstructured":"Watson, B.W.: An incremental DFA minimization algorithm. Finite State Methods in Natural Language Processing. In: ESSLLI Workshop, Helsinki, Finland, pp. 20\u201324 (August 2001)"},{"issue":"1","key":"8_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1017\/S1351324903003127","volume":"9","author":"B.W. Watson","year":"2003","unstructured":"Watson, B.W., Daciuk, J.: An efficient incremental DFA minimization algorithm. Natural Language Engineering\u00a09(1), 49\u201364 (2003)","journal-title":"Natural Language Engineering"},{"issue":"1-2","key":"8_CR11","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., S\u00e2ntean, N., Yu, S.: Minimal cover-automata for finite languages. Theoretical Computer Science\u00a0267(1-2), 3\u201316 (2001)","journal-title":"Theoretical Computer Science"},{"issue":"1-4","key":"8_CR12","first-page":"53","volume":"64","author":"C. C\u00e2mpeanu","year":"2005","unstructured":"C\u00e2mpeanu, C., P\u0103un, A., Kari, L.: Results on transforming NFA into DFCA. Fundamenta Informaticae\u00a064(1-4), 53\u201363 (2005)","journal-title":"Fundamenta Informaticae"},{"issue":"6","key":"8_CR13","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1142\/S0129054103002138","volume":"14","author":"C. C\u00e2mpeanu","year":"2003","unstructured":"C\u00e2mpeanu, C., P\u0103un, A.: Counting the number of minimal DFCA obtained by merging states. International Journal of Foundations of Computer Science\u00a014(6), 995\u20131006 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"8_CR14","unstructured":"C\u00e2mpeanu, C., P\u0103un, A.: Lower bounds for NFA to DFCA transformations. In: Proceedings of DFCS 2004, London Ontario, Canada, pp. 121\u2013130 (2004)"},{"issue":"6","key":"8_CR15","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. International Journal of Foundations of Computer Science\u00a014(6), 1071\u20131086 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44674-5_20","volume-title":"Implementation and Application of Automata","author":"A. P\u0103un","year":"2001","unstructured":"P\u0103un, A., S\u00e2ntean, N., Yu, S.: An O(n\n                           2) algorithm for minimal cover-automata for finite languages. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol.\u00a02088, pp. 243\u2013251. Springer, Heidelberg (2001)"},{"key":"8_CR17","unstructured":"S\u00e2ntean, N.: Towards a Minimal Representation for Finite Languages: Theory and Practice. MSc thesis, Department of Computer Science, The University of Western Ontario, Canada (2000)"},{"key":"8_CR18","unstructured":"World Wide Web: The Grail+ project. A symbolic computation environment for finite-state machines, regular expressions, and finite languages (2002), \n                    \n                      http:\/\/www.csd.uwo.ca\/Research\/grail"},{"key":"8_CR19","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 (1979)"},{"key":"8_CR20","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, London (1973)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume-title":"Handbook of Formal Languages","author":"S. Yu","year":"1997","unstructured":"Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0I, pp. 41\u2013110. Springer, Heidelberg (1997)"},{"issue":"1","key":"8_CR22","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1142\/S0129054102000960","volume":"13","author":"C. C\u00e2mpeanu","year":"2002","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\u00a013(1), 83\u201398 (2002)","journal-title":"International Journal of Foundations of Computer Science"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:05:27Z","timestamp":1619507127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11605157_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}