6 6 votes Consider a Finite State Automaton (FSA) $\mathbf{M1}$ designed to recognize a specific language over the alphabet $\{0,1\}$. Which of the following best describes the language $\mathbf{L}(\mathbf{M1})$ accepted by this automaton? All strings that contain at least four $1$'s. All strings that end with the substring "$01110$". All strings that contain the substring "$01110$". All strings that have exactly three $1$'s followed by a $0$. Theory of Computation goclasses theory-of-computation goclasses-cs-dpp goclasses-cs-dpp-day-141 goclasses-toc-practice-questions + – GO Classes 668 views answer comment Share Follow Print See 1 comment 1 1 comment reply Naveen_Kirar commented Nov 25, 2025 reply Follow flag C 0 0 replyShare Please log in or register to add a comment.
1 1 vote It would be B,C in msq and c in mcq because the machine aggrees to take 01110 and even if we repaeat after 0 it goes on loop which tells that it even if string has 0 and 1s after the main substring machine is supposed to find out it will eventually accept and if even it ends on 0 it will be accepted. And C in mcq because C is a bigger set whose subset is B i.e. containing the substring is a super set of the set of strings that end with the required substring. Thank You. divyanshu_create answered Nov 27, 2025 divyanshu_create comment Share Follow 0 reply Please log in or register to add a comment.
1 1 vote C for B as final state have self (0,1). it can end with (0+1)* so option B X contains Atlest 3 '1,s' so option A X Ashish_Deore 1 answered Dec 7, 2025 Ashish_Deore 1 comment Share Follow 0 reply Please log in or register to add a comment.
1 1 vote $A. False, 1111\ has\ at\ least\ 4\ ones\ but\ is\ not\ accepted$ $B.False, 011101 \in L_m\ but\ it\ does\ not\ end\ with\ given\ string\ 0111.$ $D.as\ no\ 0's\ in \ 1,11,111\ still \ not\ accepted.$ Hence Answer is C amanbadone0 answered Dec 31, 2025 amanbadone0 comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Ans : Option C Rohit_jain 1 answered Nov 25, 2025 Rohit_jain 1 comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes All strings that contain the substring "01110". Aparna Bharti answered Apr 29 Aparna Bharti comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes For option a counter example is 01110 is accepted but a/q to option a it should not be acceptedFor option b after 01110 it should not come anything but in given dfa it (0+1)^* is comingFor option d it is saying it three one is coming it should be followed by 0 , but if three one is not coming it should be accepted like 1, 11 but they are not accepted.So option C is correct Vivid_Vivek answered Jun 4 Vivid_Vivek comment Share Follow 0 reply Please log in or register to add a comment.