Research Article
Packet Payload Monitoring for Internet Worm Content Detection Using Deterministic Finite Automaton with Delayed Dictionary Compression
Table 2
Patterns for regular expression.
| Syntax | Meaning | Example |
| | At the beginning, the pattern should be matched with this input. | FH Shows FH starts with this pattern as input. F with this pattern “”, matches FH anywhere in the input. |
| | OR relationship | FH Represents F or H. |
| . | A single character wildcard | F. Represents end of the string. |
| ? | Representing one or less quantifier | F? Represents F or an empty string. |
| * | Representing zero or more quantifier | F* Denotes an arbitrary number of Fs. |
| | Repeat | F{200} Means 200 Fs. |
| | A class of characters | ejk Represents a letter , j, or k. |
| | Anything but | Represents any character But not . |
|
|