{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:56:05Z","timestamp":1725490565673},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424918"},{"type":"electronic","value":"9783540446743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44674-5_18","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T09:49:49Z","timestamp":1188294589000},"page":"217-229","source":"Crossref","is-referenced-by-count":3,"title":["Direct Construction of Minimal Acyclic Subsequential Transducers"],"prefix":"10.1007","author":[{"given":"Stoyan","family":"Mihov","sequence":"first","affiliation":[]},{"given":"Denis","family":"Maurel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"18_CR1","volume-title":"Data Structures and Algorithms","author":"A. Aho","year":"1983","unstructured":"A. Aho, J. Hopcroft, J. Ullman, Data Structures and Algorithms, Addison-Wesley, Reading, Massachutes, 1983."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"J. Daciuk, S. Mihov, B. Watson, R. Watson, Incremental Construction of Minimal Acyclic Finite State Automata, Computational Linguistics, Vol. 26(1), 2000.","DOI":"10.1162\/089120100561601"},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(99)00022-5","volume":"231","author":"D. Maurel","year":"2000","unstructured":"D. Maurel, Pseudo-minimal transducer, Theoretical Computer Science, Vol. 231(1), 129\u2013139, 2000.","journal-title":"Theoretical Computer Science"},{"key":"18_CR4","unstructured":"S. Mihov, Direct Building of Minimal Automaton for Given List, Annuaire de l\u2019Universit\u00e9 de Sofia \u201cSt. Kl. Ohridski\u201d, Facult\u00e9 de Math\u00e9matique et Informatique, volume 91, livre 1, 1998."},{"key":"18_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Minimization of Sequential Transducers","author":"M. Mohri","year":"1994","unstructured":"M. Mohri, Minimization of Sequential Transducers, Lecture Notes in Computer Science, Springer, Berlin, 1994."},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S135132499600126X","volume":"2","author":"M. Mohri","year":"1996","unstructured":"M. Mohri, On Some Applications of Finite-State Automata Theory to Natural Language Processing, Natural Language Engineering, Vol. 2(1), 1\u201320, 1996.","journal-title":"Natural Language Engineering"},{"issue":"2","key":"18_CR7","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"M. Mohri, Finite-State Transducers in Language and Speech Processing, Computational Linguistics, Vol. 23(2), 269\u2013311, 1997.","journal-title":"Computational Linguistics"},{"key":"18_CR8","unstructured":"D. Revuz, Dictionaires et lexiques-M\u00e9thodes et algorithms, Doctoral dissertation in Computer Science, University Paris VII, Paris, 1991."}],"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-44674-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T22:58:22Z","timestamp":1550876302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44674-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424918","9783540446743"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44674-5_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}