Problem 1: a) Find all strings in L((a + b)*b(a + ab)*) of length less than...

Transcribed Image Text:

Problem 1: a) Find all strings in L((a + b)*b(a + ab)*) of length less than four. b) Provide 2 strings that are from and 2 strings that are not from the language of the regular expression R = a(ba)*b(aa+b) c) Provide 2 strings that are from and 2 strings that are not from the language of the regular expression R = ( (a+b)a(b+λ) d) Find a regular expression for the language L-{ab"w:n ≥ 3, w € {a,b} + } e) Find a regular expression for the language L={w | there are exactly 2 a's in w} f) Find a regular expression for the language L={ww contains at most 1 b and at least 2 a's} Problem 1: a) Find all strings in L((a + b)*b(a + ab)*) of length less than four. b) Provide 2 strings that are from and 2 strings that are not from the language of the regular expression R = a(ba)*b(aa+b) c) Provide 2 strings that are from and 2 strings that are not from the language of the regular expression R = ( (a+b)a(b+λ) d) Find a regular expression for the language L-{ab"w:n ≥ 3, w € {a,b} + } e) Find a regular expression for the language L={w | there are exactly 2 a's in w} f) Find a regular expression for the language L={ww contains at most 1 b and at least 2 a's}

Answer rating: 100% (QA)

Answer a To find all strings in the language La bba ab of length less than four we can generate all possible strings of length less than four using the alphabet a b and check if each string belongs to ... View the full answer