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

@inproceedings{Ngassam2004AFF,
  title={A framework for the dynamic implementation of finite automata for performance enhancement},
  author={Ernest Ketcha Ngassam and Bruce W. Watson and Derrick G. Kourie},
  booktitle={Int. J. Found. Comput. Sci.},
  year={2004}
}
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… 

Figures from this paper

Hardcoding and dynamic implementation of finite automata
TLDR
It is shown that the history of the states previously visited in the dynamic framework in order to predict the suitable algorithm for acceptance testing can be relied on and help further the investigations on the problem of the dynamic implementation of finite automata.
Dynamic Allocation of Finite Automata States for Fast String Recognition
TLDR
It is shown that the algorithm, referred to as the Dynamic State Allocation algorithm outperforms the traditional table-driven algorithm for strings that tend to repeatedly access the same set of states, provided that the string is long enough to amortize the allocation cost.
Reordering finite automata states for fast string recognition
TLDR
The spatial and temporal locality of reference on which cache memory relies to minimize cache swaps, is exploited to design a new algorithm for finite automaton string recognition that outperforms the traditional table-driven algorithm for strings that tend to repeatedly access the same set of states.
Proceedings of the Eindhoven FASTAR Days 2004
TLDR
The algorithm is an extension of an incremental construction algorithm for acyclic deterministic automata (ADFAs) and similar extensions of two other construction algorithms for ADFAs are presented.
A framework for benchmarking FA-based string recognizers
TLDR
A unified framework for frequently evaluating existing FA-based string recognizers such that FA-implementers could capture appropriate problem domains that guarantee an optimal performance of available recognizers is proposed.

References

SHOWING 1-10 OF 17 REFERENCES
Hardcoding finite automata
TLDR
The main result of this work is that the hardcoded implementations of finite automata outperform the table-driven implementation up to some threshold, which emphasizes that many applications using finite Automata as basic model may be optimized by replacing the table -driven implementation with a hardcoded implementation, resulting to better performances.
Hardcoding finite state automata processing
TLDR
This paper presents various experiments in hardcoding the transition table of a finite state machine directly into string-recognizing code and measures are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.
Preliminary Experiments in Hardcoding Finite Automata
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
The working set model for program behavior
TLDR
A new model, the “working set model,” is developed, defined to be the collection of its most recently used pages, which provides knowledge vital to the dynamic management of paged memories.
Stretching and jamming of automata
TLDR
This paper presents two transformations on automata, called stretching and jamming, which will, under certain conditions, reduce the size of the transition table, and under other conditions reduce the string recognition time.
Fast Pattern Matching in Strings
TLDR
An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.
Flexible pattern matching in strings - practical on-line search algorithms for texts and biological sequences
TLDR
This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice, and includes all of the most significant new developments in complex pattern searching.
Phd by thesis
  • R. Lathe
  • Geography, Environmental Science
    Nature
  • 1988
Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most
299-300
  • September
  • 2003
Taxonomies and Toolkits of Regular Languages Algorithms
  • Taxonomies and Toolkits of Regular Languages Algorithms
  • 1995
...
...