Ngassam, EKKourie, DGWatson, BW2010-12-142010-12-142010-10Ngassam, EK, Kourie, DG and Watson, BW. 2010. Framework for benchmarking FA-based string recognizers. Proceedings of SAICSIT 2010 Annual Research Conference of the South African Institute of Computer Scientist and Information Technologists. Bela Bela, South Africa, 11-13 October 2010, pp 220-230http://hdl.handle.net/10204/4672Proceedings of SAICSIT 2010 Annual Research Conference of the South African Institute of Computer Scientist and Information Technologists. Bela Bela, South Africa, 11-13 October 2010Previous work on implementations of FA-based string recognizers suggested a range of implementation strategies (and therefore, algorithms) aiming at improving their performance for fast string recognition. However, an efficient exploitation of suggested algorithms by domain-specific FA-implementers requires prior knowledge of the behaviour (performance-wise) of each algorithm in order to make an informed choice. The authors propose a based string recognizers such that FA-implementers could capture appropriate problem domains that gaurantee an optimal performance of available recognizers. The suggested framework takes into consideration factors such as the kind of automan being processed, the string and alphabet size as well as the overall behaviour of the automan at run-time. It is well known that performance remains a significant bottle-neck to the high-performance solutions required in such industrial applications.enAutomataString recognizerAutomata implementationAlgorithmsComputer scienceInformation technologistsConference PresentationNgassam, E., Kourie, D., & Watson, B. (2010). Framework for benchmarking FA-based string recognizers. Association for Computing Machinery. http://hdl.handle.net/10204/4672Ngassam, EK, DG Kourie, and BW Watson. "Framework for benchmarking FA-based string recognizers." (2010): http://hdl.handle.net/10204/4672Ngassam E, Kourie D, Watson B, Framework for benchmarking FA-based string recognizers; Association for Computing Machinery; 2010. http://hdl.handle.net/10204/4672 .TY - Conference Presentation AU - Ngassam, EK AU - Kourie, DG AU - Watson, BW AB - Previous work on implementations of FA-based string recognizers suggested a range of implementation strategies (and therefore, algorithms) aiming at improving their performance for fast string recognition. However, an efficient exploitation of suggested algorithms by domain-specific FA-implementers requires prior knowledge of the behaviour (performance-wise) of each algorithm in order to make an informed choice. The authors propose a based string recognizers such that FA-implementers could capture appropriate problem domains that gaurantee an optimal performance of available recognizers. The suggested framework takes into consideration factors such as the kind of automan being processed, the string and alphabet size as well as the overall behaviour of the automan at run-time. It is well known that performance remains a significant bottle-neck to the high-performance solutions required in such industrial applications. DA - 2010-10 DB - ResearchSpace DP - CSIR KW - Automata KW - String recognizer KW - Automata implementation KW - Algorithms KW - Computer science KW - Information technologists LK - https://researchspace.csir.co.za PY - 2010 T1 - Framework for benchmarking FA-based string recognizers TI - Framework for benchmarking FA-based string recognizers UR - http://hdl.handle.net/10204/4672 ER -