Finite state automaton compression

Details Finite state automaton compression Finite state automaton compression

2005-08-31

2010-02-09

Dada, Beemnet W (Department: 2435)

Information security

Monitoring or scanning of software or data including attack...

Intrusion detection

Reexamination Certificate

active

07661138

ABSTRACT:
A system and method for intrusion detection and prevention processing are described. One or more states of a finite state automaton (FSA) stored in a memory may be compressed to form compressed state information. The FSA may include a set of states and defined state transitions for input characters. The compressed state information may include individual entries for the characters having a corresponding state transition to a next state, and a single entry for the values having a corresponding state transition to a common state. Context data may be searched using the compressed state information.

REFERENCES:
patent: 7305383 (2007-12-01), Kubesh et al.
patent: 2004/0083387 (2004-04-01), Dapp et al.
patent: 2005/0035784 (2005-02-01), Gould et al.
patent: 2005/0278400 (2005-12-01), Kang et al.
patent: 2006/0218161 (2006-09-01), Zhang et al.
patent: 2008/0140662 (2008-06-01), Pandya
Kiraz, G. A.: “Compressed Storage of Sparse Finite-State Transducers”; Lecture Notes in Computer Science, vol. 2214/2001, Jan. 2001, pp. 109-121.

Affiliated with

Also associated with

Rating

Finite state automaton compression does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Finite state automaton compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite state automaton compression will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4212092