Then L(M), the language accepted by the machine M, is the set of all strings having:
A. two or more b’s
B. three or more b’s
C. two or more a’s
D. three or more a’s
Answer:A
Then L(M), the language accepted by the machine M, is the set of all strings having:
A. two or more b’s B. three or more b’s C. two or more a’s D. three or more a’s