ON IMPLEMENTATION AND PERFORMANCE OF TABLE-DRIVEN DFA-BASED STRING PROCESSORS

DOI10.1142/S012905410800553XzbMATH Open1169.68486OpenAlexW2002945619MaRDI QIDQ3532140FDOQ3532140

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

Publication date: 3 November 2008

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

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

Recommendations

• DYNAMIC ALLOCATION OF FINITE AUTOMATA STATES FOR FAST STRING RECOGNITION
• Ternary directed acyclic word graphs
• A FRAMEWORK FOR THE DYNAMIC IMPLEMENTATION OF FINITE AUTOMATA FOR PERFORMANCE ENHANCEMENT
• On-line string matching algorithms: survey and experimental results
• A note on mc-DFA and its minimization

zbMATH Keywords

string processing

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Nonnumerical algorithms (68W05)

Cites Work

• The Complexity of Pattern Matching for a Random String
• Title not available (Why is that?)

Cited In (3)

• A FRAMEWORK FOR THE DYNAMIC IMPLEMENTATION OF FINITE AUTOMATA FOR PERFORMANCE ENHANCEMENT
• On Parallel Implementations of Deterministic Finite Automata
• DYNAMIC ALLOCATION OF FINITE AUTOMATA STATES FOR FAST STRING RECOGNITION

This page was built for publication: ON IMPLEMENTATION AND PERFORMANCE OF TABLE-DRIVEN DFA-BASED STRING PROCESSORS

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