𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A compact function for regular expression pattern matching

✍ Scribed by Martin Richards

Book ID
112209641
Publisher
John Wiley and Sons
Year
1979
Tongue
English
Weight
357 KB
Volume
9
Category
Article
ISSN
0038-0644

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new algorithm for linear regular tree
A new algorithm for linear regular tree pattern matching
✍ Priti Shankar; Amitranjan Gantait; A.R. Yuvaraj; Maya Madhavan πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 129 KB

We consider the problem of linear regular tree pattern matching and describe a new solution based on a bottom up technique. Current bottom up techniques preprocess the patterns and construct a ΓΏnite state tree pattern matching automaton for the purpose. Though matching time is linear in the size of

A new regular grammar pattern matching a
A new regular grammar pattern matching algorithm
✍ Bruce W. Watson πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 155 KB

This paper presents a Boyer-Moore type algorithm for regular grammar pattern matching, answering a variant of an open problem posed by Aho (Pattern Matching in Strings, Academic Press, New York, 1980, p. 342). The new algorithm handles patterns speciΓΏed by regular (left linear) grammars-a generaliza

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