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

DOI10.1142/S012905410800553XzbMath1169.68486OpenAlexW2002945619MaRDI QIDQ3532140

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

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

zbMATH Keywords

string processing

Mathematics Subject Classification ID

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

Related Items (1)

On Parallel Implementations of Deterministic Finite Automata

Cites Work

• The Complexity of Pattern Matching for a Random String
• Unnamed Item

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