Question: 1. Give a regular expression that represents the described set: a. L- (wl w is the set of strings over a,b in which every a
1. Give a regular expression that represents the described set: a. L- (wl w is the set of strings over a,b in which every a is either immediately proceeded by a b or immediately followed by a b] example: baab aba, b b. L- (w w is the set of strings over a,b that do not contain the substring ab example: baa, b, a, bba, aaaa with odd length and contain exactly 2 ?3(WI w is the set of strings over b) example: bba, aababaa c. 2. Convert the following regular expressions to ?-NFA a. 01*0
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
