1.L2 = E{0,1)All the words in L2 with equal number of 0's and 1's and every prex of w has at most two more of either0's or 1's.2.All words that does not contain bbb as substring.i think this is :( e + b + bb)(a + ab + abb)*Thanks in advance!
I need to present a regular expression for the following languages:
regular expressions