A new regular grammar pattern matching algorithm.

DOI10.1016/S0304-3975(02)00532-7MaRDI QIDQ1874408zbMATH OpenFDO

Authors B. W. Watson

Publication date 25 May 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(02)00532-7

zbMATH Keywords

Boyer-Moore algorithmPattern matching algorithmsRegular grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• A new regular grammar pattern matching algorithm
• A Boyer-Moore-style algorithm for regular expression pattern matching.
• Fastest Pattern Matching in Strings
• On Boyer-Moore automata
• A simple fast hybrid pattern-matching algorithm

Cites work

• A fast string searching algorithm
• A new regular grammar pattern matching algorithm
• A taxonomy of sublinear multiple keyword pattern matching algorithms
• Efficient string matching
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 140453 (Why is no real title available?)
• scientific article; zbMATH DE number 3633757 (Why is no real title available?)
• scientific article; zbMATH DE number 1142294 (Why is no real title available?)
• scientific article; zbMATH DE number 194543 (Why is no real title available?)
• scientific article; zbMATH DE number 798342 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)

Cited in

(5)

• A Boyer-Moore-style algorithm for regular expression pattern matching.
• A new algorithm for regularizing one-letter context-free grammars.
• scientific article; zbMATH DE number 1533832 (Why is no real title available?)
• A new regular grammar pattern matching algorithm
• A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms

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 Q1874408)