Partial derivatives of regular expressions and finite automaton constructions
V Antimirov - Theoretical Computer Science, 1996 - Elsevier
We introduce a notion of partial derivative of a regular expression and apply it to finite
automaton constructions. The notion is a generalization of the known notion of word …
automaton constructions. The notion is a generalization of the known notion of word …
Incremental construction of minimal acyclic finite-state automata
In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-
state automata from a set of strings. Traditional methods consist of two phases: the first to …
state automata from a set of strings. Traditional methods consist of two phases: the first to …
Processing XML streams with deterministic automata and stream indexes
We consider the problem of evaluating a large number of XPath expressions on a stream of
XML packets. We contribute two novel techniques. The first is to use a single Deterministic …
XML packets. We contribute two novel techniques. The first is to use a single Deterministic …
FSA context switch architecture for programmable intelligent search memory
AA Pandya - US Patent 7,890,692, 2011 - Google Patents
Memory architecture provides capabilities for high performance content search. The
architecture creates an innovative memory that can be programmed with content search …
architecture creates an innovative memory that can be programmed with content search …
Embedded programmable intelligent search memory (PRISM) that simultaneously performs regular expression based search and signature pattern based search
AA Pandya - US Patent 8,051,022, 2011 - Google Patents
Memory architecture provides capabilities for high perfor mance content search. The
architecture creates an innovative memory that can be programmed with content search …
architecture creates an innovative memory that can be programmed with content search …
Characterization of Glushkov automata
P Caron, D Ziadi - Theoretical Computer Science, 2000 - Elsevier
Glushkov's algorithm computes a nondeterministic finite automaton without ε-transitions and
with n+ 1 states from a regular expression having n occurrences of letters. The aim of this …
with n+ 1 states from a regular expression having n occurrences of letters. The aim of this …
Compiler for compiling content search rules comprising a regular expression using a programmable intelligent search memory (PRISM) and vectors
AA Pandya - US Patent 8,055,601, 2011 - Google Patents
Memory architecture provides capabilities for high performance content search. Content
search rules comprise of regular expressions which are compiled to finite state automata …
search rules comprise of regular expressions which are compiled to finite state automata …
Complex symbol evaluation for programmable intelligent search memory
AA Pandya - US Patent 7,827,190, 2010 - Google Patents
Memory architecture provides capabilities for high performance content search. The
architecture creates an innovative memory that can be programmed with content search …
architecture creates an innovative memory that can be programmed with content search …
Signature search architecture for programmable intelligent search memory
AA Pandya - US Patent 7,831,606, 2010 - Google Patents
Memory architecture provides capabilities for high performance content search. The
architecture creates an innovative memory that can be programmed with content search …
architecture creates an innovative memory that can be programmed with content search …
100GBPS security and search architecture using programmable intelligent search memory (PRISM) that comprises one or more bit interval counters
AA Pandya - US Patent 7,996,348, 2011 - Google Patents
Memory architecture provides capabilities for high performance content search. The
architecture creates an innovative memory that can be programmed with content search …
architecture creates an innovative memory that can be programmed with content search …