14 search results - page 2 / 3 » Short Regular Expressions from Finite Automata: Empirical Re... |
104
click to vote
JACM
2002
15 years 1 months ago
2002
In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivale...
112
click to vote
ISOLA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
149
click to vote
ICC
2011
IEEE
14 years 1 months ago
2011
IEEE
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
106
click to vote
DLT
2010
15 years 2 months ago
2010
The partial derivative automaton (Apd) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of th...
186
click to vote
SIGCOMM
2006
ACM
15 years 7 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...