UGC NET CSE | December 2007 | Part 2 | Question: 5

Question

Consider a Moore machine $M$ whose digraph is :

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 1

A. two or more b’s ...

 

Minimum state that is acceptable by the moore machine M is bb ...

So the language contact 0 occurred or more occurrence of a ' s and 2 or more occurrence of b' s ...

So we can strike off options B , C , D ...