DYNAMIC ALLOCATION OF FINITE AUTOMATA STATES FOR FAST STRING RECOGNITION

DOI10.1142/S0129054106004431zbMath1169.68487OpenAlexW2126488569MaRDI QIDQ3421847

Ernest Ketcha Ngassam, Derrick G. Kourie, Bruce W. Watson

Publication date: 8 February 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054106004431

zbMATH Keywords

performanceautomataimplementationcache locality of referencedynamic state allocation

Mathematics Subject Classification ID

Searching and sorting (68P10) Formal languages and automata (68Q45) Semisimple Lie groups and their representations (22E46) Differential geometry of symmetric spaces (53C35) Noncompact Lie groups of transformations (57S20)

Cites Work

• The Complexity of Pattern Matching for a Random String
• Fast Pattern Matching in Strings

This page was built for publication: DYNAMIC ALLOCATION OF FINITE AUTOMATA STATES FOR FAST STRING RECOGNITION