C. Given = {a, b): 1. Write a regular expression for the set: \"All strings of a

Question

C. Given = {a, b): 1. Write a regular expression for the set: "All strings of a's and b's beginning with bb and not having three consecutive a's" 2. Describe in English the languages denoted by the following regular expression: (a + b)'b(a+ b) 3. Write a regular expression for the following language L(w) = {w/ w has exactly a single substring abaa or exactly a single substring babb) 4. Write a regular expression for the following language: L(w) (w w ends in bb and does net contain the substring aba)

Explanation / Answer

ANSWER :

1. bb(aab + ab + b)*

2. All strings of a's and b's having atleast 1 b.

3. (b*a*abaaa*b* + a*b*babb*b*a*)

4. (a+b)*aba(a+b)*bb

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.