Show each of these languages is regular by designing a regular expression for ea
ID: 3598563 • Letter: S
Question
Show each of these languages is regular by designing a regular expression for each language. All languages are over the alphabet = {0, 1. a) b) c) d) e) f) g) h) i) j) LI = { IUE * lw ends with 1} * 1 L2 = { w E * lw starts and ends with the same symbol) (0*0) U (1 * 1) U0ul L3-| 1v * lw contains at least five Is} * I I'l * I I'l I'l * L4-1ve2*lu' contains at most four 0s} 1*01*01*01*01* L5 = {w * l the length of w is odd } () * * L6 = { w * l the number of Is in w is not divisible by 31 L7 = { w E * lw ends with the substring 1 10 or 1 1 } (* 1 10) U (* 1 1 ) L8-1UE *lw contains 00 1 * L9 = { IUE *I every third symbol in w is a l} 1 (1)* Lio = { w *I every block of consecutive 0s in w is even in length) the substring 10011 I'lExplanation / Answer
As per Chegg policy, I am answering to only first 4 questions:
a.) L1 = (0+1)*1
b.) L2 = 0(0+1)*0 + 1(0+1)*1 + 0 + 1 + epsilon
c.) L3 = (0+1)*1(0+1)*1(0+1)*1(0+1)*1(0+1)*1(0+1)*
d.) L4 = 1*01*01*01*01*
Hope it helps, feels free to comment in case of any query.