In theoretical computer science and formal language theory, a regular expression (abbreviated regex or regexp and sometimes called a rational expression) is a sequence of characters that define a search pattern, mainly for use in pattern matching with strings, or string matching, i.e. "find and replace"-like operations.
| Attributes | Values |
|---|---|
| rdfs:comment |
|
| foaf:depiction | |
| thumbnail | |
| is rdfs:seeAlso of | |
| is genre of | |
| is influenced by of |