Ngassam E.K.; Kourie D.G.; Watson B.W.
(2006)
We study the performance of a hardcoded algorithm for recognizing strings of a finite automaton's language and compare it with the use of the more conventional table-driven algorithm. In both cases, performance depends on ...