Method for compressing space of finite automaton

A technology of space compression and automaton, which is applied in the field of network security, can solve problems such as the inability to increase the speed of DFA space conversion at the same time, and achieve the effect of increasing the matching speed and improving the compression effect

Inactive Publication Date: 2010-01-20
INST OF COMPUTING TECH CHINESE ACAD OF SCI
View PDF0 Cites 18 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0015] The purpose of the present invention is to overcome the defect that the prior art cannot simultaneously improve the compression effect of the DFA ...

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for compressing space of finite automaton
  • Method for compressing space of finite automaton
  • Method for compressing space of finite automaton

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0055] The present invention will be described below in conjunction with the accompanying drawings and specific embodiments.

[0056] In this embodiment, the regular expression ".*A.{2}CD" is taken as an example to illustrate the process of compressing the DFA space of the regular expression.

[0057] First, the DFA corresponding to the regular expression ".*A.{2}CD" is generated. Since the process of generating a DFA from a regular expression is a well-known technology in the art, it will not be repeated here. exist figure 1 A schematic diagram of the DFA generated by the regular expression ".*A.{2}CD" is given in . In the figure, numbers such as 0, 1, 2, and 3 in the circle represent states, and the DFA has 10 states ranging from 0 to 9. The horizontal lines with arrows represent the conditions for transferring from one state to another state, and the letters on the arrows, such as A, C, D, and Not A (indicating any character other than A), represent the specific content ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a method for compressing the space of a finite automaton, comprising the steps: executing each status in the finite automaton in a clustering way to obtain a plurality of clusters for expressing a status set; classifying transfer edges of the each status in the finite automaton according to the clusters so as to obtain a plurality of cluster matrixes, bitmaps corresponding to the cluster matrixes and remaining matrixes, wherein the cluster matrixes comprise transfer edges for pointing to the same cluster, the bitmaps are used for describing the effectiveness of correlative elements in the cluster matrixes corresponding thereto, and the remaining matrixes comprise remaining transfer edges which are not contained in the cluster matrixes in the finite automaton; and extracting a basic value for each row in the cluster matrixes, converting the cluster matrixes into an offset matrix, merging the each row in the offset matrix, and adding with a index data set for marking a status which can be merged, to obtain compression matrixes of the cluster matrixes. The method improves not only compression effect but also matching speed when realizing regular expression match.

Description

technical field [0001] The invention relates to the field of network security, in particular to a space compression method for determining an automaton. Background technique [0002] A regular expression (Regular Expression) is a single string used in computer science to describe or match a series of strings that conform to a certain syntax rule. The method of using regular expressions to match text content that matches a certain pattern is also called a regular expression matching algorithm. The regular expression matching algorithm has always been one of the research focuses of computer science, and it is widely used in many fields such as network intrusion detection, computer virus signature matching, network information content security, and information retrieval. [0003] Deterministic automaton (DFA) is the basis of regular expression matching algorithm, and DFA is stored in the form of state transition table in the computer. Generally, the basic process of regular e...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
Inventor 杨毅夫刘燕兵刘萍郭莉
Owner INST OF COMPUTING TECH CHINESE ACAD OF SCI
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap