1729 search results - page 2 / 346 » Deterministic Expressions in C |
CONEXT
2007
ACM
13 years 9 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
SAMOS
2005
Springer
13 years 11 months ago
2005
Springer
The design of appropriate communication architectures for complex Systems-on-Chip (SoC) is a challenging task. One promising alternative to solve these problems are Networks-on-Chi...
JSA
2007
2007
Application of deterministic and stochastic Petri-Nets for performance modeling of NoC architectures
13 years 5 months ago
The design of appropriate communication architectures for complex Systems-on-Chip (SoC) is a challenging task. One promising alternative to solve these problems are Networks-on-Ch...
CAV
2007
Springer
13 years 11 months ago
2007
Springer
C32SAT is a tool for checking C expressions. It can check whether a given C expression can be satisfied, is tautological, or always defined according to the ISO C99 standard. C32...
INFOCOM
2011
IEEE
12 years 9 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....