✦ LIBER ✦

An improved DFA for fast regular expression matching

✍ Scribed by Ficara, Domenico; Giordano, Stefano; Procissi, Gregorio

Book ID: 118173695
Publisher: Association for Computing Machinery
Year: 2008
Tongue: English
Weight: 444 KB
Volume: 38
Category: Article
ISSN: 0146-4833
DOI: 10.1145/1452335.1452339

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast, memory-efficient regular expressio

Fast, memory-efficient regular expression matching with NFA-OBDDs

✍ Liu Yang; Rezwana Karim; Vinod Ganapathy; Randy Smith 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 691 KB

A compact function for regular expressio

A compact function for regular expression pattern matching

✍ Martin Richards 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB

A Subquadratic Algorithm for Approximate

A Subquadratic Algorithm for Approximate Regular Expression Matching

✍ S. Wu; U. Manber; E. Myers 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 673 KB

The main result of this paper is an algorithm for approximate matching of a regular expression of size \(m\) in a text of size \(n\) in time \(O\left(n m / \log _{d+2} n\right)\), where \(d\) is the number of allowed errors. This algorithm is the first \(o(m n)\) algorithm for approximate matching t

A pipelined processor architecture for r

A pipelined processor architecture for regular expression string matching

✍ Qiyue Li; Jie Li; Jianping Wang; Baohua Zhao; Yugui Qu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 630 KB

AN IMPROVED LIGHT FOR COLOUR MATCHING

✍ DUFTON, ARTHUR ;GARDNER, WALTER M. 📂 Article 📅 2008 🏛 Wiley (Blackwell Publishing) 🌐 English ⚖ 597 KB

An improved parallel algorithm for maxim

An improved parallel algorithm for maximal matching

✍ Amos Israeli; Y. Shiloach 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 291 KB