Non-regular Languages

Non-regular Languages

Regular Expressions can be used to denote only a fixed number or unspecified number of repetitions.

Examples of nonregular languages:

1. The set of all strings of balanced parentheses

e.g.., (()), (()()(())), etc. - nested comments are also nonregular.

2. The set of all palindromes. {wv| v is the reverse of w, w is a

string over the alphabet.}

3. Repeating Strings { ww| w a string over the alphabet}.

Previous slide Next slide Back to the first slide View Graphic Version