Question: Give a regular expression for the following language over {a,b}: L2 = The set of all strings having a substring aa and having a substring
Give a regular expression for the following language over {a,b}:
L2 = The set of all strings having a substring aa and having a substring bb and ending with ba.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
