97 search results - page 13 / 20 » Normalized Expressions and Finite Automata |
COLT
2006
Springer
13 years 11 months ago
2006
Springer
Given a finite set of words w1, . . . , wn independently drawn according to a fixed unknown distribution law P called a stochastic language, an usual goal in Grammatical Inference ...
HOTI
2008
IEEE
14 years 1 months ago
2008
IEEE
— Recent network intrusion detection systems (NIDS) use regular expressions to represent suspicious or malicious character sequences in packet payloads in a more efficient way. ...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Traditional content based publish/subscribe (pub/sub) systems allow users to express stateless subscriptions evaluated on individual events. However, many applications such as moni...
TON
2012
11 years 9 months ago
2012
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...