## Discussion Forum

Que. | Consider the machine M given below. The language recognized by M is : |

a. | {w ∈ {a, b}* / every a in w is followed by exactly two b's} |

b. | {w ∈ {a, b}* every a in w is followed by at least two b’} |

c. | {w ∈ {a, b}* w contains the substring 'abb'} |

d. | {w ∈ {a, b}* w does not contain 'aa' as a substring} |

Answer:{w ∈ {a, b}* every a in w is followed by at least two b’} |