A framework for the dynamic implementation of finite automata for performance enhancement

E.K. Ngassam, B.W. Watson, D.G. Kourie

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of the Prague Stringology Conference '04 (PSC 2004, Prague, Czech Republic, August 30-September 1, 2004)
EditorsM. Simánek, J. Holub
Place of PublicationPrague, Czech Republic
PublisherCzech Technical University in Prague
Pages155-167
ISBN (Print)80-01-03050-4
Publication statusPublished - 2004

Fingerprint

Dive into the research topics of 'A framework for the dynamic implementation of finite automata for performance enhancement'. Together they form a unique fingerprint.

Cite this