Hardcoding finite state automata processing

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

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

Abstract

To hardcode and algorithm means to build into it the data that it requires. In this paper, we present various experiments in hardcoding the transition table of a finite state machine directly into string-recognizing code. Experiments are carried out in two phases. The first phase is limited to the analysis of the hardcoded behavior in relation to acceptance or rejection of a single symbol in some arbitrary state of some finite automaton. Then follows a simulation of the analysis of some hardcoded solution for recognizing an entire string. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.
Original languageEnglish
Title of host publicationProceedings of the 2003 annual research conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology (SAICSIT, Fourways, South Africa, September 17-19, 2003)
EditorsJ. Eloff, xx et al.
Place of PublicationNew York
PublisherAssociation for Computing Machinery, Inc
Pages111-121
ISBN (Print)1-58113-774-5
Publication statusPublished - 2003

Publication series

NameACM International Conference Proceeding Series
Volume47

Fingerprint Dive into the research topics of 'Hardcoding finite state automata processing'. Together they form a unique fingerprint.

  • Cite this

    Ngassam, E. K., Watson, B. W., & Kourie, D. G. (2003). Hardcoding finite state automata processing. In J. Eloff, & X. et al. (Eds.), Proceedings of the 2003 annual research conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology (SAICSIT, Fourways, South Africa, September 17-19, 2003) (pp. 111-121). (ACM International Conference Proceeding Series; Vol. 47). Association for Computing Machinery, Inc.