Preliminary experiments in hardcoding finite automata

Authors:
E. Ketcha Ngassam;Bruce W. Watson;Derrick G. Kourie
Affiliations:
Department of Computer Science, University of Pretoria, Pretoria, South Africa;Department of Computer Science, University of Pretoria, Pretoria, South Africa;Department of Computer Science, University of Pretoria, Pretoria, South Africa
Venue:
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Year:
2003

Citing 0
Cited 3

Hardcoding finite state automata processing

SAICSIT '03 Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
Performance of hardcoded finite automata

Software—Practice & Experience - Research Articles
A framework for benchmarking FA-based string recognizers

SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists

Quantified Score

Hi-index	0.00

Visualization

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.