0 votes 0 votes No of states in Min DFA, that accepts (1)* over {0,1} alphabets is 1 states 2 states None of these Theory of Computation minimal-state-automata theory-of-computation + – hacker16 asked Dec 17, 2017 hacker16 293 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Rishabh Gupta 2 commented Dec 17, 2017 reply Follow Share 2 states. One will be the accepting state, and one will be the dead state. 2 votes 2 votes hacker16 commented Dec 17, 2017 reply Follow Share and let say if the set of alphabet would be {1}, then answer should be 1 right? 0 votes 0 votes Rishabh Gupta 2 commented Dec 17, 2017 reply Follow Share Then there will be 3 states. One is the initial state, one is the accepting state, and one will be the dead state. 0 votes 0 votes Please log in or register to add a comment.
