{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:19Z","timestamp":1725545059280},"publisher-location":"Berlin, Heidelberg","reference-count":5,"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_29","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"341-342","source":"Crossref","is-referenced-by-count":1,"title":["Incremental and Semi-incremental Construction of Pseudo-Minimal Automata"],"prefix":"10.1007","author":[{"given":"Jan","family":"Daciuk","sequence":"first","affiliation":[]},{"given":"Denis","family":"Maurel","sequence":"additional","affiliation":[]},{"given":"Agata","family":"Savary","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Revuz, D.: Dictionnaires et lexiques: m\u00e9thodes et algorithmes. PhD thesis, Institut Blaise Pascal, Paris, France, LITP 91.44 (1991)","key":"29_CR1"},{"doi-asserted-by":"crossref","unstructured":"Maurel, D.: Pseudo-minimal transducer. Theoretical Computer Science, 129\u2013139 (2000)","key":"29_CR2","DOI":"10.1016\/S0304-3975(99)00022-5"},{"key":"29_CR3","volume-title":"Proceedings of Intelligent Information Systems. New Trends in Intelligent Information Processing and Web Mining. Advances in Soft Computing","author":"J. Daciuk","year":"2005","unstructured":"Daciuk, J., Maurel, D., Savary, A.: Dynamic perfect hashing with finite-state automata. In: Proceedings of Intelligent Information Systems. New Trends in Intelligent Information Processing and Web Mining. Advances in Soft Computing, Springer, Heidelberg (2005)"},{"key":"29_CR4","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.: Incremental construction of minimal acyclic finite state automata. Computational Linguistics\u00a026, 3\u201316 (2000)","journal-title":"Computational Linguistics"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","first-page":"91","volume-title":"Third Workshop on Implementing Automata","author":"B. Watson","year":"1998","unstructured":"Watson, B.: A fast new (semi-incremental) algorithm for the construction of minimal acyclic DFAs. In: Third Workshop on Implementing Automata, Rouen, France. LNCS, pp. 91\u201398. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/11605157_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:05:22Z","timestamp":1619507122000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/11605157_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":5,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/11605157_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}