Preliminary experiments in hardcoding finite automata

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

doi:10.1007/3-540-45089-0_29

Preliminary experiments in hardcoding finite automata

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

Software Engineering and Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

5 Citations (Scopus)

Abstract

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 efficiency gains by various hardcoded versions over the traditional table-driven algorithm.

Original language	English
Title of host publication	Implementation and Application of Automata (Proceedings 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003)
Editors	O.H. Ibarra, Z. Dang
Place of Publication	Berlin
Publisher	Springer
Pages	299-300
ISBN (Print)	3-540-40561-5
DOIs	https://doi.org/10.1007/3-540-45089-0_29
Publication status	Published - 2003

Publication series

Name	Lecture Notes in Computer Science
Volume	2759
ISSN (Print)	0302-9743

Access to Document

10.1007/3-540-45089-0_29

Cite this

Ngassam, E. K., Watson, B. W., & Kourie, D. G. (2003). Preliminary experiments in hardcoding finite automata. In O. H. Ibarra, & Z. Dang (Eds.), Implementation and Application of Automata (Proceedings 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003) (pp. 299-300). (Lecture Notes in Computer Science; Vol. 2759). Springer. https://doi.org/10.1007/3-540-45089-0_29

@inproceedings{08f75f0983f44af7ad9f7b1c3dff661b,

title = "Preliminary experiments in hardcoding finite automata",

abstract = "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 efficiency gains by various hardcoded versions over the traditional table-driven algorithm.",

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

year = "2003",

doi = "10.1007/3-540-45089-0\_29",

language = "English",

isbn = "3-540-40561-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "299--300",

editor = "O.H. Ibarra and Z. Dang",

booktitle = "Implementation and Application of Automata (Proceedings 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003)",

address = "Germany",

}

Ngassam, EK, Watson, BW & Kourie, DG 2003, Preliminary experiments in hardcoding finite automata. in OH Ibarra & Z Dang (eds), Implementation and Application of Automata (Proceedings 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003). Lecture Notes in Computer Science, vol. 2759, Springer, Berlin, pp. 299-300. https://doi.org/10.1007/3-540-45089-0_29

Preliminary experiments in hardcoding finite automata. / Ngassam, E.K.; Watson, B.W.; Kourie, D.G.
Implementation and Application of Automata (Proceedings 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003). ed. / O.H. Ibarra; Z. Dang. Berlin: Springer, 2003. p. 299-300 (Lecture Notes in Computer Science; Vol. 2759).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Preliminary experiments in hardcoding finite automata

AU - Ngassam, E.K.

AU - Watson, B.W.

AU - Kourie, D.G.

PY - 2003

Y1 - 2003

N2 - 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 efficiency gains by various hardcoded versions over the traditional table-driven algorithm.

AB - 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 efficiency gains by various hardcoded versions over the traditional table-driven algorithm.

U2 - 10.1007/3-540-45089-0_29

DO - 10.1007/3-540-45089-0_29

M3 - Conference contribution

SN - 3-540-40561-5

T3 - Lecture Notes in Computer Science

SP - 299

EP - 300

BT - Implementation and Application of Automata (Proceedings 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003)

A2 - Ibarra, O.H.

A2 - Dang, Z.

PB - Springer

CY - Berlin

ER -

Ngassam EK, Watson BW, Kourie DG. Preliminary experiments in hardcoding finite automata. In Ibarra OH, Dang Z, editors, Implementation and Application of Automata (Proceedings 8th International Conference, CIAA 2003, Santa Barbara, California, USA, July 16-18, 2003). Berlin: Springer. 2003. p. 299-300. (Lecture Notes in Computer Science). doi: 10.1007/3-540-45089-0_29

Preliminary experiments in hardcoding finite automata

Abstract

Publication series

Access to Document

Fingerprint

Cite this