|
CIAA2003 |
START ConferenceManager |
Hardcoding Finite State Automata Processing
E Ketcha Ngassam, Bruce W Watson, Derrick G Kourie
Presented at
Eighth International Conference on Implementation and Application of
Automata (CIAA 2003),
July 16-18, 2003
Santa Barbara, CA, USA
Abstract
Various experiments in hardcoding the transition table of a finite state machine directly into string-recognizing code are presented.
Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.