Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1142/S012905410800553X | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | DocType | Volume |
deterministic finite automata, Table-driven algorithms, performance, recognizer denotational semantic, string recognizer, string processor | Journal | 19 |
Issue | ISSN | Citations |
1 | 0129-0541 | 1 |
PageRank | References | Authors |
0.40 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ernest Ketcha Ngassam | 1 | 17 | 4.66 |
| Derrick G. Kourie | 2 | 223 | 33.10 |
| Bruce W. Watson | 3 | 338 | 53.24 |