Question

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

Answer 1

The following regular expression will be:

a) (b*ba)*bb* U b*

b) b*a*

c) a(aa)*ba(aa)*ba(aa)* + a(aa)*b(aa)*b(aa)* + (aa)*ba(aa)*b(aa)* + (aa)*b(aa)*ba(aa)*

What is regular expression?

A regular expression is a string of letters that provides a text search pattern. String-searching algorithms typically use such patterns for "find" or "find as well as replace" operations on strings, as well as input validation.

a) Regular expression for the set of all strings of a’s and b’s in which each a is immediately proceeded or immediately followed by a 'b':(b*ba)*bb* U b*

b) Regular expression for all strings of a’s and b’s which do not contain the substring ab: b*a*

c) Regular expression for all strings of a’s and b’s  of odd length which contain exactly 2 b: a(aa)*ba(aa)*ba(aa)* + a(aa)*b(aa)*b(aa)* + (aa)*ba(aa)*b(aa)* + (aa)*b(aa)*ba(aa)*

To learn more about regular expression
https://brainly.com/question/14469911
#SPJ4