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

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

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

1 Citaat (Scopus)
2 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
Pagina's (van-tot)1193-1206
TijdschriftInternational Journal of Foundations of Computer Science
Volume16
Nummer van het tijdschrift6
DOI's
StatusGepubliceerd - 2005

Vingerafdruk

Duik in de onderzoeksthema's van 'A framework for the dynamic implementation of finite automata for performance enhancement'. Samen vormen ze een unieke vingerafdruk.

Citeer dit