{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T17:34:53Z","timestamp":1769189693872,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642312649","type":"print"},{"value":"9783642312656","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31265-6_9","type":"book-chapter","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T03:28:23Z","timestamp":1339471703000},"page":"110-123","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata"],"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":"9_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. Commun. ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-13509-5_25","volume-title":"Combinatorial Pattern Matching","author":"O. AitMous","year":"2010","unstructured":"AitMous, O., Bassino, F., Nicaud, C.: Building the Minimal Automaton of A\n                  *\n                  X in Linear Time, When X Is of Bounded Cardinality. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol.\u00a06129, pp. 275\u2013287. Springer, Heidelberg (2010)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Baker, T.P.: A technique for extending rapid exact-match string matching to arrays of more than one dimension. SIAM J. Comput., 533\u2013541 (1978)","DOI":"10.1137\/0207043"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1142\/S0129054110007398","volume":"21","author":"F. Bassino","year":"2010","unstructured":"Bassino, F., Giambruno, L., Nicaud, C.: The average state complexity of rational operations on finite languages. Int. J. Found. Comput. Sci.\u00a021(4), 495\u2013516 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"5","key":"9_CR5","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/0020-0190(77)90017-5","volume":"6","author":"R.S. Bird","year":"1977","unstructured":"Bird, R.S.: Two dimensional pattern matching. Inf. Process. Lett.\u00a06(5), 168\u2013170 (1977)","journal-title":"Inf. Process. Lett."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on strings. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546853"},{"key":"9_CR7","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford Univ. Press (1994)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E.: An n logn algorithm for minimizing states in a finite automaton. In: Theory of Machines and Computations, pp. 189\u2013196. Academic Press (1971)","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"9_CR9","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley (1979)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press (2005)","DOI":"10.1017\/CBO9781107341005"},{"key":"9_CR11","unstructured":"Revuz, D.: Dictionnaires et lexiques: methodes et algorithmes. PhD thesis, Institut Blaise Pascal (1991)"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","volume":"92","author":"D. Revuz","year":"1992","unstructured":"Revuz, D.: Minimisation of acyclic deterministic automata in linear time. Theoret. Comput. Sci.\u00a092(1), 181\u2013189 (1992)","journal-title":"Theoret. Comput. Sci."}],"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-31265-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:54:22Z","timestamp":1620129262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31265-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312649","9783642312656"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31265-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}