A new regular grammar pattern matching algorithm

DOI10.1007/3-540-61680-2_68MaRDI QIDQ4595500zbMATH OpenOpenAlexFDO

Authors B. W. Watson

Publication date 5 December 2017

Published in Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61680-2_68

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)

Recommendations

• A new regular grammar pattern matching algorithm.
• A Boyer-Moore-style algorithm for regular expression pattern matching.
• Fastest Pattern Matching in Strings
• Fast-Search: A new efficient variant of the Boyer-Moore string matching algorithm
• A taxonomy of sublinear multiple keyword pattern matching algorithms

Cited in

(6)

• A Boyer-Moore-style algorithm for regular expression pattern matching.
• A new algorithm for regularizing one-letter context-free grammars.
• Regular expression searching on compressed text
• A new regular grammar pattern matching algorithm.
• A Four Russians algorithm for regular expression pattern matching
• scientific article; zbMATH DE number 1533832 (Why is no real title available?)

This page was built for publication: A new regular grammar pattern matching algorithm

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