On hardcoding finite state automata processing

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

On hardcoding finite state automata processing

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

Software Engineering and Technology

Onderzoeksoutput: Boek/rapport › Rapport › Academic

127 Downloads (Pure)

Samenvatting

In this paper, we present various experiments in hardcoding the transition table of a finite state machine directly into stringrecognizing code. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.

Originele taal-2	Engels
Plaats van productie	Eindhoven
Uitgeverij	Technische Universiteit Eindhoven
Aantal pagina's	29
Status	Gepubliceerd - 2003

Publicatie series

Naam	Computer science reports
Volume	0310
ISSN van geprinte versie	0926-4515

Toegang tot document

200310Definitieve gepubliceerde versie, 230 KB

Citeer dit

@book{bd74d0aa6c6041e2a960d1bc1022e9f5,

title = "On hardcoding finite state automata processing",

abstract = "In this paper, we present various experiments in hardcoding the transition table of a finite state machine directly into stringrecognizing code. 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",

series = "Computer science reports",

publisher = "Technische Universiteit Eindhoven",

}

TY - BOOK

T1 - On hardcoding finite state automata processing

AU - Ngassam, E.K.

AU - Watson, B.W.

AU - Kourie, D.G.

PY - 2003

Y1 - 2003

N2 - In this paper, we present various experiments in hardcoding the transition table of a finite state machine directly into stringrecognizing code. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.

AB - In this paper, we present various experiments in hardcoding the transition table of a finite state machine directly into stringrecognizing code. Measurements are provided to show the time efficiency gains by various hardcoded versions over the traditional table-driven approach.

M3 - Report

T3 - Computer science reports

BT - On hardcoding finite state automata processing

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -

On hardcoding finite state automata processing

Samenvatting

Publicatie series

Toegang tot document

Vingerafdruk

Citeer dit