Simultaneous search for several binary patterns in a stream with finite-state automaton

MaRDI QIDQ5150638zbMATH OpenFDO

Authors I. V. Pankratov

Publication date 15 February 2021

Full work available at URL http://mathnet.ru/eng/pdm457

zbMATH Keywords

Aho-Corasick string matchingbit subsequences searchKnuth-Morris-Pratt algorithmstring matchingsynchronization

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Recommendations

• scientific article; zbMATH DE number 1045407
• Fast pattern matching method for a bitstream
• On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
• Distributed pattern matching using finite automata
• Accelerating Boyer-Moore searches on binary texts

Cites work

• Efficient string matching
• Fast Pattern Matching in Strings

This page was built for publication: Simultaneous search for several binary patterns in a stream with finite-state automaton

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