{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T20:46:09Z","timestamp":1699994769334},"reference-count":3,"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":[[2005,12]]},"abstract":"<jats:p> The aim of this work is to provide a model for the dynamic implementation of finite automata for enhanced performance. Investigations have shown that hardcoded finite automata outperforms the traditional table-driven implementation up to some threshold. Moreover, the kind of string being recognized plays a major role in the overall processing speed of the string recognizer. Various experiments are depicted to show when the advantages of using hardcoding as basis for implementing finite automata (instead of using the classical table-driven approach) become manifest. The model, a dynamic algorithm that combines both hardcoding and table-driven is introduced. <\/jats:p>","DOI":"10.1142\/s0129054105003753","type":"journal-article","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T06:54:25Z","timestamp":1133506465000},"page":"1193-1206","source":"Crossref","is-referenced-by-count":1,"title":["A FRAMEWORK FOR THE DYNAMIC IMPLEMENTATION OF FINITE AUTOMATA FOR PERFORMANCE ENHANCEMENT"],"prefix":"10.1142","volume":"16","author":[{"given":"ERNEST KETCHA","family":"NGASSAM","sequence":"first","affiliation":[{"name":"School of Computing,  University of South Africa, Pretoria, 0003, South Africa"}]},{"given":"BRUCE W.","family":"WATSON","sequence":"additional","affiliation":[{"name":"Department of Computer Science,  University of Pretoria, Pretoria, 0002, South Africa"}]},{"given":"DERRICK G.","family":"KOURIE","sequence":"additional","affiliation":[{"name":"Department of Computer Science,  University of Pretoria, Pretoria, 0002, South Africa"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316135228"},{"key":"rf7","first-page":"323","volume":"11","author":"Thompson K.","journal-title":"Communications of ACM"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054105003753","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:29:13Z","timestamp":1565177353000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054105003753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":3,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,12]]}},"alternative-id":["10.1142\/S0129054105003753"],"URL":"https:\/\/doi.org\/10.1142\/s0129054105003753","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}