0 votes 0 votes Theory of Computation finite-automata theory-of-computation number-of-states + – Parshu gate asked Nov 6, 2017 Parshu gate 1.6k views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Ashwani Kumar 2 commented Nov 6, 2017 reply Follow Share 4 is correct..What is the given answer? 0 votes 0 votes Parshu gate commented Nov 6, 2017 reply Follow Share given 9 states 0 votes 0 votes abhishekmehta4u commented Nov 27, 2017 reply Follow Share reguler expression is (0+1+2)*1(0+1+2). now we drow nfa and convert into dfa then we ger 9 state 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes 4 states. LeenSharma answered Nov 6, 2017 • selected Nov 10, 2017 by srestha LeenSharma comment Share Follow See all 3 Comments See all 3 3 Comments reply aditya rawat commented Nov 9, 2017 reply Follow Share Check with the input 121. It doesn't terminate in the final state. 0 votes 0 votes LeenSharma commented Nov 9, 2017 reply Follow Share yes, string $"121"$can't be accepted by DFA because in the string $"121"$ second last symbol is 2. 0 votes 0 votes aditya rawat commented Nov 10, 2017 reply Follow Share thanks 0 votes 0 votes Please log in or register to add a comment.
0 votes 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 See all 3 3 Comments reply akash.dinkar12 commented Nov 11, 2017 reply Follow Share 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 votes 0 votes aditya rawat commented Nov 16, 2017 reply Follow Share Yes its 4 , I got the correction. Thanks 0 votes 0 votes suryaprakash commented Jan 7, 2018 reply Follow Share yes correct answer is 3 states, before minimization and after minimization in both the cases 0 votes 0 votes Please log in or register to add a comment.