0 votes 0 votes Examples of accepted words: 1011, 101101, 1111 Example of non-accepted words: 101, 1001, 010 The solution says the min-DFA contains 5 states but I could only do it in 4. Am I correct or where am I going wrong? My solution: Theory of Computation theory-of-computation finite-automata + – koushriek asked May 19, 2022 koushriek 1.4k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Kabir5454 commented May 19, 2022 reply Follow Share “111” is accepted by the dfa but it should not as it has odd length. 2 votes 2 votes koushriek commented May 20, 2022 reply Follow Share @Kabir5454 Can the transition on ‘1’ at q3 go to q2? 0 votes 0 votes koushriek commented May 20, 2022 reply Follow Share Maybe I see now where I was going wrong. Is this one correct? 1 votes 1 votes Please log in or register to add a comment.