Consider the machine M: The language recognized by M is :
2005
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 111 students.
Show answer & explanation
Correct answer: B
A)This option says every 'a' must be followed by exactly two b's."abbb" is also accepted. Hence this option is not correct.
B)This option says every 'a' must be followed by at least two b's. This is correct.
C)This option describes strings containing 'abb' as a substring. Consider the string"aaabb" it is not accepted by the mechine. it has substring "abb".
D)This option refers to strings that avoid 'aa' as a substring. Single "a" is not accepted. it don't have "aa" as substring. Hence this option is wrong.
A video solution is available for this question — log in and enroll to watch it.