A range of implementation strategies of DFA-based string recognizers is suggested. The strategies are associated with parameters which modify the implementation of conventional DFA implementations (table-driven and hardcoded). These parameters are used to provide a formal characterization of DFA-based string recognizers. Various instantiations of these parameters correspond to various DFA-based string processing algorithms. The algorithms derived are further classified, based on the refinement of some of them, resulting in a taxonomy tree. The tree will form the basis for further studies on the design and implementation of DFA-based string processors.
[1]
Donald E. Knuth,et al.
Fast Pattern Matching in Strings
,
1977,
SIAM J. Comput..
[2]
Ken Thompson,et al.
Programming Techniques: Regular expression search algorithm
,
1968,
Commun. ACM.
[3]
Derrick G. Kourie,et al.
TABASCO: a taxonomy-based domain engineering method
,
2005
.
[4]
Derrick G. Kourie,et al.
Reordering finite automata states for fast string recognition
,
2005,
Stringology.
[5]
Susan M. Merritt,et al.
An inverted taxonomy of sorting algorithms
,
1985,
CACM.
[6]
Ernest Ketcha Ngassam,et al.
Hardcoding finite automata
,
2005
.