1 votes 1 votes 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 : two or more b’s three or more b’s two or more a’s three or more a’s Theory of Computation ugcnetcse-dec2007-paper2 + – go_editor asked Mar 28, 2020 edited Jun 11, 2020 by soujanyareddy13 go_editor 1.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes 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 ... Awe111 answered Nov 15, 2021 Awe111 comment Share Follow See all 0 reply Please log in or register to add a comment.