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

dc.contributor.author	Ketcha Ngassam E.	en
dc.contributor.author	Watson B.W.	en
dc.contributor.author	Kourie D.G.	en
dc.date.accessioned	2012-11-01T16:31:35Z
dc.date.available	2012-11-01T16:31:35Z
dc.date.issued	2005	en
dc.identifier.citation	International Journal of Foundations of Computer Science	en
dc.identifier.citation	16	en
dc.identifier.citation	6	en
dc.identifier.issn	1290541	en
dc.identifier.other	10.1142/S0129054105003753	en
dc.identifier.uri	http://hdl.handle.net/10500/7379
dc.description.abstract	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. © World Scientific Publishing Company.	en
dc.language.iso	en	en
dc.subject	Automata implementation; Finite Automata; Hardcoding; Performance	en
dc.title	A framework for the dynamic implementation of finite automata for performance enhancement	en
dc.type	Conference Paper	en