A fast bit-parallel algorithm for matching extended regular expressions

DOI10.1007/3-540-45071-8_24MaRDI QIDQ3082930zbMATH OpenOpenAlexFDO

Authors Hiroaki Yamamoto, Takashi Miyazaki

Publication date 18 March 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45071-8_24

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Recommendations

• scientific article; zbMATH DE number 1962812
• scientific article; zbMATH DE number 2080996
• scientific article; zbMATH DE number 1929959
• scientific article; zbMATH DE number 5717242
• New Algorithms for Regular Expression Matching

Cited in

(13)

• A Boyer-Moore-style algorithm for regular expression pattern matching.
• Bit-coded Regular Expression Parsing
• A polynomial time match test for large classes of extended regular expressions
• A Method to Overcome Computer Word Size Limitation in Bit-Parallel Pattern Matching
• A Four Russians algorithm for regular expression pattern matching
• scientific article; zbMATH DE number 1962812 (Why is no real title available?)
• scientific article; zbMATH DE number 2080996 (Why is no real title available?)
• scientific article; zbMATH DE number 1759456 (Why is no real title available?)
• scientific article; zbMATH DE number 1929959 (Why is no real title available?)
• A Subquadratic Algorithm for Approximate Regular Expression Matching
• Efficient Submatch Extraction for Practical Regular Expressions
• High-Performance and Compact Architecture for Regular Expression Matching on FPGA
• An Effective Algorithm for the Membership Problem for Extended Regular Expressions

This page was built for publication: A fast bit-parallel algorithm for matching extended regular expressions

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