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?
`

- A.
L(M) = {Set of all words starting with aabb}
- B.
L(M) = {Set of all words having aabb as a sub word}
- C.
L(M) = {Set of all words ending with aabb}
- 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 freeLoading lesson…

