On hardcoding finite state automata processing
Ernest Ketcha Ngassam, Bruce W. Watson, D.G. Kourie · TU/e Research Portal · 2003
In this paper, we present various experiments in hardcoding the transition table of a finite state machine directly into stringrecognizing code. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.