Gratis ordbok - engelska svenska tyska lexikon

Definitioner

Substantiv

1. (computing theory) A concise description of a regular formal language with notations for concatenation, alternation, and iteration (repetition) of subexpressions.
2. (computing more generally) Any pattern for text matching or searching, frequently offering more or less functionality than a theoretical regular expression.