112 results about "Deterministic finite automaton" patented technology

A hierarchical tree of deterministic finite automata (DFA) is traversed and / or generated based on a set of regular expressions. The hierarchical DFA includes a root DFA linked together with a set of leaf DFAs, and possibly a set of branch DFAs. The root DFA is always active and is responsive to an input string, as are any currently active branch and leaf DFAs. When a final state or arc is reached or traversed in any active DFA, a regular expression has been matched. The branch and leaf DFAs are activated in response to the root DFA or a branch DFA reaching or traversing an activation state or arc corresponding to the branch or leaf DFA. Active branch and leaf DFAs will become inactive when a termination state or arc is reached or traversed within the branch or leaf DFA. State explosion in the hierarchical DFA can typically be avoided by selectively grouping similar portions of the regular expressions together in branch and leaf DFAs.

The invention provides an interactive-question semantic understanding method in intelligent customer services. The method includes the following steps that the conversation content between current intelligent customer services and clients is subjected to co-text language environment expression, wherein co-text language environment expression comprises event expression and language environment expression; according to the co-text language environment expression, a conversation semantic event graph is constructed; according to multiple conversation corpora of the intelligent customer services and the clients, a business logic tree is constructed; according to a determined finite state automata, an order state machine is established; according to the semantic event graph, logic decision branches are selected from the business logic tree; according to the logic decision branches and the order state machine, a semantic processing template is returned to the intelligent customer services, and semantic expression generation is carried out. According to the interactive-question semantic understanding method in the intelligent customer services, interaction questions and answers based on aflow diagram are achieved, the accuracy of client interrogation understanding of the intelligent customer services is increased, the consistency between the intelligent customer services and client conversations is guaranteed, and the work efficiency of the intelligent customer services is improved.

The present invention provides a method and apparatus for searching multiple strings within a packet data using deterministic finite automata. The apparatus includes means for updating memory tables stored in a layered memory architecture comprising a BRAM, an SRAM and a DRAM; a mechanism to strategically store the relevant data structure in the three memories based on the characteristics of data, size / capacity of the data structure, and frequency of access. The apparatus intelligently and efficiently places the associated data in different memories based on the observed fact that density of most rule-sets is around 10% for common data in typical network intrusion prevention systems. The methodology and layered memory architecture enable the apparatus implementing the present invention to achieve data processing line rates over 2 Gbps.

A hardware accelerator personality compiler, by distinguishing the marks corresponding to each executable function, logo, variable, syntax, grammatical rules, special symbols, etc. Formal notation provides the specification of a set of expected executable functions, automatically generating error-free state tables. The tokens can be recursive (eg infinite), in which case the tokens are transformed into deterministic finite automata or non-deterministic finite automata. The non-deterministic finite automaton is transformed into a finite automaton and then into state transitions for creating a state table which can then be stored, or preferably loaded into a finite state machine of a hardware parser accelerator , to define its personality.

A system and a method for decompression-free inspection of compressed data are provided herein. The method includes the following stages: obtaining a dictionary file comprising a string of symbols, each associated with a respective index; obtaining at least one delta file associated with said dictionary file, wherein said delta file comprises a sequence of instructions that include at least one copy instruction pointing to an index within said dictionary and a length of a copy substring to be copied; scanning said dictionary using a pattern matching algorithm associated with a plurality of patterns and implemented as a Deterministic Finite Automaton (DFA), to yield DFA execution data; scanning said at least one delta file, using said pattern matching algorithm, wherein said DFA execution data is used to skip at least part of the scanning of the copy substrings for at least one of the copy instructions.