0 0 votes Theory of Computation finite-automata theory-of-computation number-of-states + – Parshu gate 2.5k views answer comment Share Follow Print See all 3 Comments 3 3 Comments reply Ashwani Kumar 2 commented Nov 6, 2017 reply Follow flag 4 is correct..What is the given answer? 0 0 replyShare Parshu gate commented Nov 6, 2017 reply Follow flag given 9 states 0 0 replyShare abhishekmehta4u commented Nov 27, 2017 reply Follow flag reguler expression is (0+1+2)*1(0+1+2). now we drow nfa and convert into dfa then we ger 9 state 0 0 replyShare Please log in or register to add a comment.
Best answer 4 4 votes 4 states. LeenSharma answered Nov 6, 2017 • selected Nov 10, 2017 by srestha LeenSharma comment Share Follow See all 3 Comments 3 3 Comments reply aditya rawat commented Nov 9, 2017 reply Follow flag Check with the input 121. It doesn't terminate in the final state. 0 0 replyShare LeenSharma commented Nov 9, 2017 reply Follow flag yes, string $"121"$can't be accepted by DFA because in the string $"121"$ second last symbol is 2. 0 0 replyShare aditya rawat commented Nov 10, 2017 reply Follow flag thanks 0 0 replyShare Please log in or register to add a comment.
0 0 votes My answer is 3. I am unable to upload the image of solution. Help me with it aditya rawat answered Nov 9, 2017 aditya rawat comment Share Follow See all 3 Comments 3 3 Comments reply akash.dinkar12 commented Nov 11, 2017 reply Follow flag follow basic procedure, if u are feeling difficulty with directly draw DFA then draw NFA and then convert it into DFA, in this it is easy, u will get 4 states minimal DFA as given in best answer. 0 0 replyShare aditya rawat commented Nov 16, 2017 reply Follow flag Yes its 4 , I got the correction. Thanks 0 0 replyShare suryaprakash commented Jan 7, 2018 reply Follow flag yes correct answer is 3 states, before minimization and after minimization in both the cases 0 0 replyShare Please log in or register to add a comment.
