V. Bruyere, R. Baeza-Yates, O. Delgrange, and R. Scheihing. On the size of BoyerMoore automata. In Third South American Workshop on String Processing, pages 31--46, Recife, Brazil, August 1996. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A Unified View to String Matching Algorithms - Baeza-Yates (1996) (1 citation) Self-citation (Baeza-yates) (Correct)
....have a pattern shift associated. The problem of the maximum number of states of BMA for patterns of length m is still unknown. A lower bound of Omega Gamma m 3 ) is known [BYCG94] and there is clear evidence that this bound is not tight and a Omega Gamma m 5 ) lower bound is conjectured in [BBYDS96]. So, for this case, DFA might be too large for most practical purposes. For approximate string matching with at most k errors, we have that from the dynamic programming solution it is possible to compute the DFA directly using a recursive construction [Ukk85b] The first idea is to ignore exact ....
V. Bruyere, R. Baeza-Yates, O. Delgrange, and R. Scheihing. On the size of BoyerMoore automata. In Third South American Workshop on String Processing, pages 31--46, Recife, Brazil, August 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC