3 votes 3 votes Find minimal finitte automata for L1:L1 contains set of strings starting with 1010 and length of string is divisible by 4. L2:L2 contains set of strings starting woth 1010 and its equivalent decimal value divisible by 4 Theory of Computation theory-of-computation minimal-state-automata + – Pooja Palod asked Dec 23, 2015 Pooja Palod 1.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 5 votes 5 votes For L2 the decimal equivalent of binary number is divisible by 4 only when last 2 digits of binary number will have ATLEAST 2 zeros. qR is the reject state . According to me this should be the minimal DFA . Riya Roy(Arayana) answered Dec 23, 2015 selected Dec 23, 2015 by Praveen Saini Riya Roy(Arayana) comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Himanshu1 commented Dec 23, 2015 reply Follow Share only NFA can result in minimum , as DFA is also a NFA 0 votes 0 votes Praveen Saini commented Dec 23, 2015 reply Follow Share Yes, in addition to that, to get the NFA, having minimum possible states, depend on practice. 1 votes 1 votes Riya Roy(Arayana) commented Dec 23, 2015 reply Follow Share Nice explanation above @Praveen sir ! 0 votes 0 votes Please log in or register to add a comment.