2 votes 2 votes Consider the following language over $\sum$ = {0, 1} L = {w | w $\epsilon \sum$ * and |w| is divisible by 2 and not by 4} How many sates will min-DFA accepting L will have? Theory of Computation theory-of-computation test-series minimal-state-automata regular-language + – Pranavpurkar asked Nov 11, 2022 Pranavpurkar 424 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Pranavpurkar commented Nov 11, 2022 reply Follow Share @Kabir5454 no bro 4 is given. 1 votes 1 votes Kabir5454 commented Nov 11, 2022 reply Follow Share Correct. Length of strings accepted are {2,6,10,14,18,....4n-2,......} So if we notice carefully every length of the string gives us remainder of 2 while divide by 4. So according to myhill nerode theorem it has 4 equivalent state where the state where lenght mod 4=2 will be the final state. 3 votes 3 votes Pranavpurkar commented Nov 11, 2022 reply Follow Share @Kabir5454 Yes, that’s the correct reason. Thanks. 0 votes 0 votes Please log in or register to add a comment.
Best answer 0 votes 0 votes only 4 state Chandrabhan Vishwa 1 answered Nov 12, 2022 • selected Nov 12, 2022 by Pranavpurkar Chandrabhan Vishwa 1 comment Share Follow See all 0 reply Please log in or register to add a comment.