Advertisement

Preliminary Experiments in Hardcoding Finite Automata

  • E. Ketcha Ngassam
  • Bruce. W. Watson
  • Derrick. G. Kourie
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2759)

Abstract

Various experiments in hardcoding a single row of a transition table of a finite state machine directly into symbol- recognizing code are presented. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven algorithm.

Keywords

Problem Size Finite State Machine Switch Statement Input String Assembler Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • E. Ketcha Ngassam
    • 1
  • Bruce. W. Watson
    • 1
  • Derrick. G. Kourie
    • 1
  1. 1.Department of Computer ScienceUniversity of PretoriaPretoriaSouth Africa

Personalised recommendations