A taxonomy of DFA-based string processors

Authors:
Ernest Ketcha Ngassam;Derrick G. Kourie;Bruce Watson
Affiliations:
University of South Africa, Pretoria, South Africa;University of Pretoria, South Africa;University of Pretoria, South Africa
Venue:
SAICSIT '06 Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Year:
2006

Citing 5
Cited 0

Introduction to the theory of programming languages

Introduction to the theory of programming languages
An inverted taxonomy of sorting algorithms

Communications of the ACM - Special section on computer architecture
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Computer Organization and Design

Computer Organization and Design
TABASCO: a taxonomy-based domain engineering method

SAICSIT '05 Proceedings of the 2005 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.