会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 8. 发明授权
    • Dual DFA decomposition for large scale regular expression matching
    • 用于大规模正则表达式匹配的双DFA分解
    • US09305116B2
    • 2016-04-05
    • US12763510
    • 2010-04-20
    • Virat AgarwalDavide PasettoFabrizio Petrini
    • Virat AgarwalDavide PasettoFabrizio Petrini
    • G06F7/00G06F17/30G06F17/27
    • G06F17/30985G06F17/2775
    • An apparatus includes a data processing system for matching a first input string with a first regular expression set. The data processing system includes a processor, a memory storing a computer program, a processor configured to execute the computer program. The computer program includes instructions for performing mapping at least two related symbols of the first regular expression set to a unique symbol, generating a second input string by replacing each instance of the at least two related symbols in the first input string with the unique symbol, and operating a first state machine on the input string and a second state machine on the second input string to determine whether the first input string matches with the first regular expression set.
    • 一种装置包括用于将第一输入串与第一正则表达式集匹配的数据处理系统。 数据处理系统包括处理器,存储计算机程序的存储器,配置为执行计算机程序的处理器。 计算机程序包括用于执行将第一正则表达式集合的至少两个相关符号映射到唯一符号的指令,通过用唯一符号替换第一输入字符串中的至少两个相关符号的每个实例来生成第二输入字符串, 以及在所述输入字符串上操作第一状态机,在所述第二输入字符串上操作第二状态机,以确定所述第一输入字符串是否与所述第一正则表达式组匹配。
    • 9. 发明申请
    • DUAL DFA DECOMPOSITION FOR LARGE SCALE REGULAR EXPRESSION MATCHING
    • 用于大规模常规表达匹配的双DFA分解
    • US20110258210A1
    • 2011-10-20
    • US12763510
    • 2010-04-20
    • Virat AgarwalDavide PasettoFabrizio Petrini
    • Virat AgarwalDavide PasettoFabrizio Petrini
    • G06F17/30
    • G06F17/30985G06F17/2775
    • An apparatus includes a data processing system for matching a first input string with a first regular expression set. The data processing system includes a processor, a memory storing a computer program, a processor configured to execute the computer program. The computer program includes instructions for performing mapping at least two related symbols of the first regular expression set to a unique symbol, generating a second input string by replacing each instance of the at least two related symbols in the first input string with the unique symbol, and operating a first state machine on the input string and a second state machine on the second input string to determine whether the first input string matches with the first regular expression set.
    • 一种装置包括用于将第一输入串与第一正则表达式集匹配的数据处理系统。 数据处理系统包括处理器,存储计算机程序的存储器,配置为执行计算机程序的处理器。 计算机程序包括用于执行将第一正则表达式集合的至少两个相关符号映射到唯一符号的指令,通过用唯一符号替换第一输入字符串中的至少两个相关符号的每个实例来生成第二输入字符串, 以及在所述输入字符串上操作第一状态机,在所述第二输入字符串上操作第二状态机,以确定所述第一输入字符串是否与所述第一正则表达式组匹配。
    • 10. 发明申请
    • REGULAR EXPRESSION PATTERN MATCHING USING KEYWORD GRAPHS
    • 使用关键词格局的正则表达式匹配
    • US20120221494A1
    • 2012-08-30
    • US13035488
    • 2011-02-25
    • Davide PasettoFabrizio Petrini
    • Davide PasettoFabrizio Petrini
    • G06F15/18
    • G06N5/00
    • Expanding a regular expression set into an expanded expression set that recognizes a same language as the regular expression set and includes more expressions than the regular expression set, with less operators per expression includes: logically connecting the expressions in the regular expression set; parsing the expanded expression set; transforming the parsed expanded expression set into a Glushkov automata; transforming the Glushkov automata into a modified deterministic finite automaton in order to maintain fundamental graph properties; combining the modified DFA into a keyword graph using a combining algorithm that preserves the fundamental graph properties; and computing an Aho-Corasick fail function for the keyword graph using a modified algorithm to produce a modified Aho-Corasick graph with a goto and a fail function and added information per state.
    • 将正则表达式集扩展为扩展表达式集,以识别与正则表达式集相同的语言,并包含比正则表达式集更多的表达式,每个表达式的运算符较少,包括:在正则表达式集合中逻辑连接表达式; 解析扩展表达式集; 将解析的扩展表达式转换为Glushkov自动机; 将Glushkov自动机转换为修正的确定性有限自动机,以保持基本图形属性; 使用保留基本图表属性的组合算法将修改的DFA组合成关键字图; 并使用修改的算法计算关键字图的Aho-Corasick失败函数,以产生具有goto和fail函数的修改的Aho-Corasick图,并且每个状态添加信息。