System and Method to Traverse a Non-Deterministic Finite Automata (NFA) Graph Generated for Regular Expression Patterns with Advanced Features

Patent №

US 9,507,563

Granted

2016-11-29

Filed 2014

Owner

CAVIUM, INC.

Lab

AI components

4

nlp · vision · kr · hardware

Assignment

Recorded

Dataset

AIPD

2023_r1 edition

Application

14186913

In one embodiment, a method of walking a non-deterministic finite automata (NFA) graph representing a pattern includes extracting a node type and an element from a node of the NFA graph. The method further includes matching a segment of a payload for the element by matching the payload for the element at least zero times, the number of times based on the node type.

Natural languageVisionKnowledge representationAI hardwareG06F 5/14G06F 9/3885G06F 13/28G06F 16/90344G06F 21/567H04L 41/28H04L 63/1408G06F 2205/126+1 more

AI classification

Knowledge representation1.00
Natural language0.99
AI hardware0.85
Vision0.50
Machine learning0.18
Evolutionary computation0.04
Planning0.03
Speech0.00

Ownership

CAVIUM, INC.

assignment · 324600354

Assignors

BILLA, SATYANARAYANA LAKSHMIPATHI, GOYAL, RAJAN

On an employer assignment, the assignors are typically the inventors.

From the same owner

© 2026 NYSGPT2525 LLC