{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T10:48:19Z","timestamp":1769165299346,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642135088","type":"print"},{"value":"9783642135095","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13509-5_25","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T09:19:57Z","timestamp":1277198397000},"page":"275-287","source":"Crossref","is-referenced-by-count":7,"title":["Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality"],"prefix":"10.1007","author":[{"given":"Omar","family":"AitMous","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9rique","family":"Bassino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Nicaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"25_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Communications of the ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Communications of the ACM"},{"key":"25_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"B\u00e9al, M.P., Crochemore, M.: Minimizing local automata. In: Caire, G., Fossorier, M. (eds.) IEEE International Symposium on Information Theory (ISIT 2007), 07CH37924C, pp. 1376\u20131380. IEEE Catalog (2007)","DOI":"10.1109\/ISIT.2007.4557131"},{"issue":"10","key":"25_CR4","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Communications of the ACM\u00a020(10), 62\u201372 (1977)","journal-title":"Communications of the ACM"},{"key":"25_CR5","series-title":"MRI Symposia Series","first-page":"529","volume-title":"Mathematical theory of Automata","author":"J.A. Brzozowski","year":"1962","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Mathematical theory of Automata. MRI Symposia Series, vol.\u00a012, pp. 529\u2013561. Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y (1962)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M. Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings, 392 pages. Cambridge University Press, Cambridge (2007)"},{"key":"25_CR7","doi-asserted-by":"publisher","DOI":"10.1142\/9789812778222","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publishing Company, Singapore (2002)"},{"key":"25_CR8","doi-asserted-by":"crossref","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 log n algorithm for minimizing states in a finite automaton. In: Theory of Machines and computations, pp. 189\u2013196. Academic Press, London (1971)"},{"key":"25_CR9","volume-title":"Introduction To Automata Theory, Languages, And Computation","author":"J.E. Hopcroft","year":"1990","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction To Automata Theory, Languages, And Computation. Addison-Wesley Longman Publishing Co., Inc., Boston (1990)"},{"issue":"2","key":"25_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM Journal of Computing\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"25_CR11","first-page":"217","volume":"4","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: String-matching with automata. Nordic Journal of Computing\u00a04(2), 217\u2013231 (Summer 1997)","journal-title":"Nordic Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13509-5_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:05:56Z","timestamp":1619784356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13509-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135088","9783642135095"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13509-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}