The aim of this work is to provide a model for the dynamic implementation of finite automata for enhanced performance. Investigations have shown that hardcoded finite automata outperforms the traditional table-driven implementation up to some threshold. Moreover, the kind of string being recognized plays a major role in the overall processing speed of the string recognizer. Various experiments are depicted to show when the advantages of using hardcoding as basis for implementing finite automata (instead of using the classical table-driven approach) become manifest. The model, a dynamic algorithm that combines both hardcoding and table-driven is introduced.
|Title of host publication||Proceedings of the Prague Stringology Conference '04 (PSC 2004, Prague, Czech Republic, August 30-September 1, 2004)|
|Editors||M. Simánek, J. Holub|
|Place of Publication||Prague, Czech Republic|
|Publisher||Czech Technical University in Prague|
|Publication status||Published - 2004|