Results 1  10
of
10,022
On BoyerMoore automata
 Algorithmica
, 1994
"... The notion of BoyerMoore automaton was introduced by Knuth, Morris and Pratt in their historical paper on fast pattern matching. It leads to an algorithm that requires more preprocessing but is more ecient than the original BoyerMoore's algorithm. We formalize the notion of BoyerMoore autom ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
The notion of BoyerMoore automaton was introduced by Knuth, Morris and Pratt in their historical paper on fast pattern matching. It leads to an algorithm that requires more preprocessing but is more ecient than the original BoyerMoore's algorithm. We formalize the notion of BoyerMoore
Deriving the BoyerMooreHorspool algorithm
"... frequently studied, and many different algorithms for solving it have been suggested. Watson and Zwaan in the early 1990s derived a set of wellknown solutions from a common starting point, leading to a taxonomy of such algorithms. Their taxonomy did not include a variant of the BoyerMoore algorith ..."
Abstract
 Add to MetaCart
frequently studied, and many different algorithms for solving it have been suggested. Watson and Zwaan in the early 1990s derived a set of wellknown solutions from a common starting point, leading to a taxonomy of such algorithms. Their taxonomy did not include a variant of the BoyerMoore
About the Size of BoyerMoore Automata
"... We study the size of BoyerMoore automata introduced in Knuth, Morris & Pratt's famous paper on pattern matching. We experimentally exhibit a finite class of binary patterns, which produce large BoyerMoore automata. The best approximation curve for their sizes is a polynomial O(m^7), or e ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We study the size of BoyerMoore automata introduced in Knuth, Morris & Pratt's famous paper on pattern matching. We experimentally exhibit a finite class of binary patterns, which produce large BoyerMoore automata. The best approximation curve for their sizes is a polynomial O(m^7
On BoyerMoore Preprocessing
, 2004
"... Probably the two bestknown exact string matching algorithms are the lineartime algorithm of Knuth, Morris and Pratt (KMP), and the fast on average algorithm of Boyer and Moore (BM). The efficiency of these algorithms is based on using a suitable failure function. When a mismatch occurs in the ..."
Abstract
 Add to MetaCart
Probably the two bestknown exact string matching algorithms are the lineartime algorithm of Knuth, Morris and Pratt (KMP), and the fast on average algorithm of Boyer and Moore (BM). The efficiency of these algorithms is based on using a suitable failure function. When a mismatch occurs
On the Expected Sublinearity of the BoyerMoore Algorithm
, 1988
"... . This paper analyzes the expected performance of a simplified version BM 0 of the BoyerMoore string matching algorithm. A probabilistic automaton A is set up which models the expected behavior of BM 0 under the assumption that both text and pattern are generated by a source which emits indepe ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
. This paper analyzes the expected performance of a simplified version BM 0 of the BoyerMoore string matching algorithm. A probabilistic automaton A is set up which models the expected behavior of BM 0 under the assumption that both text and pattern are generated by a source which emits
The BoyerMoore Prover and Nuprl: An Experimental Comparison
 LOGICAL FRAMEWORKS
, 1991
"... We use an example to compare the BoyerMoore Theorem Prover and the Nuprl Proof Development System. The respective machine verifications of a version of Ramsey's theorem illustrate similarities and differences between the two systems. The proofs are compared using both quantitative and nonquan ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
We use an example to compare the BoyerMoore Theorem Prover and the Nuprl Proof Development System. The respective machine verifications of a version of Ramsey's theorem illustrate similarities and differences between the two systems. The proofs are compared using both quantitative and non
A Proof of the BoyerMoore Majority Protocol
"... This note is inspired by discussions with Greg Plaxton who has observed that the BoyerMoore Majority Protocol [1] provides an excellent example for teaching program verification in an undergraduate course. I write out the proof in detail here. The first program uses certain abstract data structures ..."
Abstract
 Add to MetaCart
This note is inspired by discussions with Greg Plaxton who has observed that the BoyerMoore Majority Protocol [1] provides an excellent example for teaching program verification in an undergraduate course. I write out the proof in detail here. The first program uses certain abstract data
Average Case Analysis of the BoyerMoore Algorithm
, 2003
"... Some limit theorems (including a BerryEsseen bound) are derived for the number of comparisons taken by the BoyerMoore algorithm for finding the occurrences of a given pattern in a random Markovian text. Previously, only special variants of this algorithm have been analyzed. We also propose means o ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Some limit theorems (including a BerryEsseen bound) are derived for the number of comparisons taken by the BoyerMoore algorithm for finding the occurrences of a given pattern in a random Markovian text. Previously, only special variants of this algorithm have been analyzed. We also propose means
Results 1  10
of
10,022