Palo Alto Networks, Inc.
REDUCTION AND ACCELERATION OF A DETERMINISTIC FINITE AUTOMATON

Last updated:

Abstract:

Techniques for reduction and acceleration of a deterministic finite automaton (DFA) are disclosed. In some embodiments, a system, process, and/or computer program product for reduction and acceleration of a DFA includes receiving an input value; performing a reduced deterministic finite automaton lookup using a lookup key, wherein the lookup key comprises a current state and the input value; and determining a next state based on the lookup key.

Status:
Application
Type:

Utility

Filling date:

10 May 2022

Issue date:

25 Aug 2022