{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T03:50:24Z","timestamp":1648525824286},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2008,2]]},"abstract":"<jats:p> Table-driven (TD) DFA-based string processing algorithms are examined from a number of vantage points. Firstly, various strategies for implementing such algorithms in a cache-efficient manner are identified. The denotational semantics of such algorithms is encapsulated in a function whose various arguments are associated with each implementation strategy. This formal view of the implementation strategies suggests twelve different algorithms, each blending together the implementation strategies in a particular way. The performance of these algorithms is examined in against a set of artificially generated data. Results indicate a number of cases where the new algorithms outperform the traditional TD algorithm. <\/jats:p>","DOI":"10.1142\/s012905410800553x","type":"journal-article","created":{"date-parts":[[2008,2,20]],"date-time":"2008-02-20T09:46:31Z","timestamp":1203500791000},"page":"53-70","source":"Crossref","is-referenced-by-count":0,"title":["ON IMPLEMENTATION AND PERFORMANCE OF TABLE-DRIVEN DFA-BASED STRING PROCESSORS"],"prefix":"10.1142","volume":"19","author":[{"given":"ERNEST KETCHA","family":"NGASSAM","sequence":"first","affiliation":[{"name":"School of Computing, University of South Africa, Pretoria, 0003, South Africa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DERRICK G.","family":"KOURIE","sequence":"additional","affiliation":[{"name":"FASTAR Research Group, Department of Computer Science, University of Pretoria, Pretoria, 0002, South Africa"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BRUCE W.","family":"WATSON","sequence":"additional","affiliation":[{"name":"FASTAR Research Group, Department of Computer Science, University of Pretoria, Pretoria, 0002, South Africa"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume-title":"Computer Architecture and Organization","author":"Hayes J. P.","year":"1998"},{"key":"rf4","author":"Ketcha E. N.","journal-title":"International Journal of Foundation of Computer science"},{"key":"rf5","first-page":"368","volume":"6","author":"Knuth D. E.","journal-title":"SIAM Journal on Computing"},{"key":"rf6","volume-title":"Introduction to the Theory of Programming Languages","author":"Meyer B.","year":"1990"},{"key":"rf7","volume-title":"Computer Organization and Design","author":"Patterson D. A.","year":"2005"},{"key":"rf8","first-page":"323","volume":"11","author":"Thompson K.","journal-title":"Communications of the ACM"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1137\/0208029"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905410800553X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:29:16Z","timestamp":1565191756000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905410800553X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":7,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,2]]}},"alternative-id":["10.1142\/S012905410800553X"],"URL":"https:\/\/doi.org\/10.1142\/s012905410800553x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2]]}}}