DYNAMIC ALLOCATION OF FINITE AUTOMATA STATES FOR FAST STRING RECOGNITION

DOI10.1142/S0129054106004431zbMATH Open1169.68487OpenAlexW2126488569MaRDI QIDQ3421847FDOQ3421847

Authors: Ernest Ketcha Ngassam, B. W. Watson, Derrick Kourie 

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

Recommendations

• A FRAMEWORK FOR THE DYNAMIC IMPLEMENTATION OF FINITE AUTOMATA FOR PERFORMANCE ENHANCEMENT
• ON IMPLEMENTATION AND PERFORMANCE OF TABLE-DRIVEN DFA-BASED STRING PROCESSORS
• Incremental Construction of Minimal Acyclic Finite-State Automata
• A Table Compression Method for Extended Aho-Corasick Automaton
• scientific article; zbMATH DE number 1045407

zbMATH Keywords

performanceautomataimplementationcache locality of referencedynamic state allocation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• ON IMPLEMENTATION AND PERFORMANCE OF TABLE-DRIVEN DFA-BASED STRING PROCESSORS
• A FRAMEWORK FOR THE DYNAMIC IMPLEMENTATION OF FINITE AUTOMATA FOR PERFORMANCE ENHANCEMENT

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3421847)