Question: (b) Let ?-(a, b). Give a regular expression that describes each of the following regular languages i. The set of strings consisting of two a's,


(b) Let ?-(a, b). Give a regular expression that describes each of the following regular languages i. The set of strings consisting of two a's, followed by zero or more b's and ending with an a. ii. The set of strings ending in b and not containing the substring aaa
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
