On Boyer-Moore automata

被引：0
|
作者：
Baeza-Yates, R.A. [1 ]
Choffrut, C. [1 ]
Gonnet, G.H. [1 ]
机构：
[1] Universidad de Chile, Santiago, Chile
来源：
Algorithmica (New York) | 1994年 / 12卷 / 4-5期
关键词：
18;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：268 / 292
相关论文
共 50 条
  • [31] Composite string matching algorithm based on boyer-moore method
    Huang, Wenqi
    Xiong, Zhengda
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2009, 37 (12): : 48 - 51
  • [32] A CORRECT PREPROCESSING ALGORITHM FOR BOYER-MOORE STRING-SEARCHING
    RYTTER, W
    SIAM JOURNAL ON COMPUTING, 1980, 9 (03) : 509 - 512
  • [33] Describing and verifying synchronous circuits with the Boyer-Moore theorem prover
    Pierre, L
    CORRECT HARDWARE DESIGN AND VERIFICATION METHODS, 1995, 987 : 35 - 55
  • [34] Research on intrusion detection based on Boyer-Moore pattern matching algorithm
    Li, Yulong
    Li, Chenhao
    Jiao, Yang
    Zhao, Guogang
    Liu, Yang
    Zhang, Tian
    PROCEEDINGS OF 2023 7TH INTERNATIONAL CONFERENCE ON ELECTRONIC INFORMATION TECHNOLOGY AND COMPUTER ENGINEERING, EITCE 2023, 2023, : 1490 - 1494
  • [35] 基于WinPcap和Boyer-Moore的IDS的实现
    陈丹
    李际军
    郑增威
    计算机应用, 2004, (05) : 47 - 49
  • [36] 对Boyer-Moore定理证明器的若干改进
    姜云飞
    吉林大学自然科学学报, 1986, (04) : 109 - 115
  • [37] ON THE PREPROCESSING ALGORITHM USED IN THE BOYER-MOORE ALGORITHM FOR STRING SEARCHING.
    Semba, Ichiro
    Journal of information processing, 1986, 9 (04) : 228 - 231
  • [38] TIGHT BOUNDS ON THE COMPLEXITY OF THE BOYER-MOORE STRING-MATCHING ALGORITHM
    COLE, R
    SIAM JOURNAL ON COMPUTING, 1994, 23 (05) : 1075 - 1091
  • [39] FASTER STRING SEARCHES - BOYER-MOORE MAY BE THE ALGORITHM YOU NEED
    MENICO, C
    DR DOBBS JOURNAL, 1989, 14 (07): : 74 - 75
  • [40] ON IMPROVING THE AVERAGE CASE OF THE BOYER-MOORE STRING MATCHING ALGORITHM.
    Zhu Rui Feng
    Takaoka, Tadao
    Journal of information processing, 1987, 10 (03) : 173 - 177
12345