Consider the machine M: The language recognized by M is :
GATE · 2005 · CS
Consider the machine M:

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}
Attempted by 305 students.
Sign up free to check your answer
Sign up freeLoading lesson…