{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:36Z","timestamp":1759638276150},"publisher-location":"Berlin, Heidelberg","reference-count":7,"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_26","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:20:28Z","timestamp":1192530028000},"page":"255-261","source":"Crossref","is-referenced-by-count":5,"title":["Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings"],"prefix":"10.1007","author":[{"given":"Jan","family":"Daciuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"26_CR1","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1974."},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1162\/089120100561601","volume":"26","author":"J. Daciuk","year":"2000","unstructured":"Jan Daciuk, Stoyan Mihov, Bruce Watson, and Richard Watson. Incremental construction of minimal acyclic finite state automata. Computational Linguistics, 26(1):3\u201316, April 2000.","journal-title":"Computational Linguistics"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"John E. Hopcroft. An n log n algorithm for minimizing the states in a finite automaton. In Z. Kohavi, editor, The Theory of Machines and Computations, pages 189\u2013196. Academic Press, 1971.","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"26_CR4","unstructured":"Dominique Revuz. Dictionnaires et lexiques: m\u00e9thodes et algorithmes. PhD thesis, Institut Blaise Pascal, Paris, France, 1991. LITP 91.44."},{"issue":"1","key":"26_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","volume":"92","author":"D. Revuz","year":"1992","unstructured":"Dominique Revuz. Minimisation of acyclic deterministic automata in linear time. Theoretical Computer Science, 92(1):181\u2013189, 1992.","journal-title":"Theoretical Computer Science"},{"key":"26_CR6","unstructured":"Max Silberztein. INTEX tutorial notes. In Workshop on Implementing Automata WIA99-Pre-Proceedings, pages XIX\u20131\u2013XIX\u201331. 1999."},{"key":"26_CR7","series-title":"Lect Notes Comput Sci","first-page":"91","volume-title":"A fast new (semi-incremental) algorithm for the construction of minimal acyclic DFAs","author":"B. Watson","year":"1998","unstructured":"Bruce Watson. A fast new (semi-incremental) algorithm for the construction of minimal acyclic DFAs. In Third Workshop on Implementing Automata, pages 91\u201398, Rouen, France, September 1998. Lecture Notes in Computer Science, Springer."}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T16:23:20Z","timestamp":1556900600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}