{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:11:30Z","timestamp":1649178690487},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p> Finite (nondeterministic) automata are very useful building blocks in the field of string matching. This is particularly true in the case of multiple pattern matching, where the use of factor-based automata can reduce substantially the number of computational steps when the patterns have large common factors. <\/jats:p><jats:p> Direct simulation of nondeterministic automata can be performed very efficiently using the bit-parallelism technique, though this is not necessarily true for factor-based automata. <\/jats:p><jats:p> In this paper we present an algorithm for the multiple string matching problem, based on the bit-parallel simulation of nondeterministic factor-based automata which satisfy a particular ordering condition. We also show how to enforce such condition by suitably modifying a minimal initial automaton, through equivalence preserving transformations. The resulting automaton turns out to be smaller than the corresponding maximal automata used by existing bit-parallel algorithms, as they do not take any advantage of common factors in patterns. <\/jats:p>","DOI":"10.1142\/s0129054106004388","type":"journal-article","created":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T12:02:04Z","timestamp":1166011324000},"page":"1235-1251","source":"Crossref","is-referenced-by-count":1,"title":["A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM"],"prefix":"10.1142","volume":"17","author":[{"given":"DOMENICO","family":"CANTONE","sequence":"first","affiliation":[{"name":"Dipartimento di Matematica e Informatica, Universit\u00e0 di Catania, Viale A.Doria n.6, Catania, Italy, 95125, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SIMONE","family":"FARO","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica e Informatica, Universit\u00e0 di Catania, Viale A.Doria n.6, Catania, Italy, 95125, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1145\/135239.135243"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1145\/359842.359859"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185427"},{"key":"rf7","volume-title":"Text algorithms","author":"Crochemore M.","year":"1994"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380100608"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"rf12","volume":"5","author":"Navarro G.","journal-title":"Journal of Experimental Algorithmics"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:27:26Z","timestamp":1565191646000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":8,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1142\/S0129054106004388"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004388","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}