 |
|
| A B C D E F G H I J K L M N O P Q R S T U V W X Y Z |
|
|
regular expression
A definition for a class of strings that can be recognized by a finite-state automaton. An example of a class of strings that is regular would be legal mathematical expressions using only "+" and digits. An example that isn't regular is the same legal mathematical expressions as before, but with properly nested parentheses.
Related category
• COMPUTERS, AI, AND CYBERNETICS
Also on this site:
Encyclopedia of Alternative Energy & Sustainable Living
Encyclopedia of History
Transport Concepts & Designs (partner site)