Consider the following machine M What is the language L(M) accepted by this…

Consider the following machine M
What is the language L(M) accepted by this machine?


`

  1. A.

    L(M) = {Set of all words starting with aabb}

  2. B.

    L(M) = {Set of all words having aabb as a sub word}


  3. C.

    L(M) = {Set of all words ending with aabb}


  4. D.

    L(M) = {Set of all words with exactly one occurrence of aabb}

Attempted by 258 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…