Hardcoding finite state automata processing

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

Hardcoding finite state automata processing

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

Software Engineering and Technology

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

Samenvatting

To hardcode and algorithm means to build into it the data that it requires. In this paper, we present various experiments in hardcoding the transition table of a finite state machine directly into string-recognizing code. Experiments are carried out in two phases. The first phase is limited to the analysis of the hardcoded behavior in relation to acceptance or rejection of a single symbol in some arbitrary state of some finite automaton. Then follows a simulation of the analysis of some hardcoded solution for recognizing an entire string. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.

Originele taal-2	Engels
Titel	Proceedings of the 2003 annual research conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology (SAICSIT, Fourways, South Africa, September 17-19, 2003)
Redacteuren	J. Eloff, xx et al.
Plaats van productie	New York
Uitgeverij	Association for Computing Machinery, Inc
Pagina's	111-121
ISBN van geprinte versie	1-58113-774-5
Status	Gepubliceerd - 2003

Publicatie series

Naam	ACM International Conference Proceeding Series
Volume	47

Citeer dit

Ngassam, E. K., Watson, B. W., & Kourie, D. G. (2003). Hardcoding finite state automata processing. In J. Eloff, & X. et al. (editors), Proceedings of the 2003 annual research conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology (SAICSIT, Fourways, South Africa, September 17-19, 2003) (blz. 111-121). (ACM International Conference Proceeding Series; Vol. 47). Association for Computing Machinery, Inc.

Ngassam, E.K. ; Watson, B.W. ; Kourie, D.G. / Hardcoding finite state automata processing. Proceedings of the 2003 annual research conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology (SAICSIT, Fourways, South Africa, September 17-19, 2003). redacteur / J. Eloff ; xx et al. New York : Association for Computing Machinery, Inc, 2003. blz. 111-121 (ACM International Conference Proceeding Series).

@inproceedings{cc0d193f5d2a47f98327dcae9a4b7928,

title = "Hardcoding finite state automata processing",

abstract = "To hardcode and algorithm means to build into it the data that it requires. In this paper, we present various experiments in hardcoding the transition table of a finite state machine directly into string-recognizing code. Experiments are carried out in two phases. The first phase is limited to the analysis of the hardcoded behavior in relation to acceptance or rejection of a single symbol in some arbitrary state of some finite automaton. Then follows a simulation of the analysis of some hardcoded solution for recognizing an entire string. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.",

author = "E.K. Ngassam and B.W. Watson and D.G. Kourie",

year = "2003",

language = "English",

isbn = "1-58113-774-5",

series = "ACM International Conference Proceeding Series",

publisher = "Association for Computing Machinery, Inc",

pages = "111--121",

editor = "J. Eloff and {et al.}, xx",

booktitle = "Proceedings of the 2003 annual research conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology (SAICSIT, Fourways, South Africa, September 17-19, 2003)",

address = "United States",

}

Ngassam, EK, Watson, BW & Kourie, DG 2003, Hardcoding finite state automata processing. in J Eloff & X et al. (uitgave), Proceedings of the 2003 annual research conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology (SAICSIT, Fourways, South Africa, September 17-19, 2003). ACM International Conference Proceeding Series, vol. 47, Association for Computing Machinery, Inc, New York, blz. 111-121.

Hardcoding finite state automata processing. / Ngassam, E.K.; Watson, B.W.; Kourie, D.G.
Proceedings of the 2003 annual research conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology (SAICSIT, Fourways, South Africa, September 17-19, 2003). uitgave / J. Eloff; xx et al. New York: Association for Computing Machinery, Inc, 2003. blz. 111-121 (ACM International Conference Proceeding Series; Vol. 47).

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/Congresprocedure › Conferentiebijdrage › Academic › peer review

TY - GEN

T1 - Hardcoding finite state automata processing

AU - Ngassam, E.K.

AU - Watson, B.W.

AU - Kourie, D.G.

PY - 2003

Y1 - 2003

N2 - To hardcode and algorithm means to build into it the data that it requires. In this paper, we present various experiments in hardcoding the transition table of a finite state machine directly into string-recognizing code. Experiments are carried out in two phases. The first phase is limited to the analysis of the hardcoded behavior in relation to acceptance or rejection of a single symbol in some arbitrary state of some finite automaton. Then follows a simulation of the analysis of some hardcoded solution for recognizing an entire string. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.

AB - To hardcode and algorithm means to build into it the data that it requires. In this paper, we present various experiments in hardcoding the transition table of a finite state machine directly into string-recognizing code. Experiments are carried out in two phases. The first phase is limited to the analysis of the hardcoded behavior in relation to acceptance or rejection of a single symbol in some arbitrary state of some finite automaton. Then follows a simulation of the analysis of some hardcoded solution for recognizing an entire string. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.

M3 - Conference contribution

SN - 1-58113-774-5

T3 - ACM International Conference Proceeding Series

SP - 111

EP - 121

BT - Proceedings of the 2003 annual research conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology (SAICSIT, Fourways, South Africa, September 17-19, 2003)

A2 - Eloff, J.

A2 - et al., xx

PB - Association for Computing Machinery, Inc

CY - New York

ER -

Ngassam EK, Watson BW, Kourie DG. Hardcoding finite state automata processing. In Eloff J, et al. X, redacteurs, Proceedings of the 2003 annual research conference of the South African Institute of Computer Scientists and Information Technologists on Enablement through Technology (SAICSIT, Fourways, South Africa, September 17-19, 2003). New York: Association for Computing Machinery, Inc. 2003. blz. 111-121. (ACM International Conference Proceeding Series).

Hardcoding finite state automata processing

Samenvatting

Publicatie series

Vingerafdruk

Citeer dit