Towards cache optimization in finite automata implementations
To the best of our knowledge, the only available implementations of FA-based string recognizers are the so-called conventional table-driven algorithm and, of course, its hardcoded counterpart suggested by Thompson, Penello, and DeRemer in 1967, 1986, and 2004 respectively. However, our early experim...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2263/26467 Ketcha Ngassam, E 2007, Towards cache optimization in finite automata implementations, PhD Thesis, University of Pretoria, Pretoria, viewed yymmdd <http://hdl.handle.net/2263/26467> http://upetd.up.ac.za/thesis/available/etd-07212007-120525/ |