Multiple choice

Consider the machine M

The language recognized by M is

  1. {W $\in$ {a,b}*/ every a in w is followed by exactly two b's}
  2. {W $\in$ {a,b}*/ every a in w is followed by at least two b's}
  3. {W $\in$ {a,b}*/ w contains the substring 'abb'
  4. {W $\in$ {a,b}*/ w does not contain 'aa' as a substring}
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

From the given FSM , it is clear that a not necessity followed by only 2b due to self loop at final state. But at least 2b's are there. abb substring not always, Similarly aa not always.

Keep practicing — related questions