0 votes 0 votes Theory of Computation theory-of-computation finite-automata made-easy-test-series + – Anurag Parothia 1 asked Aug 24, 2018 • edited Mar 4, 2019 by Aditi Singh Anurag Parothia 1 340 views answer comment Share Follow See 1 comment See all 1 1 comment reply Rutvik Reshamwala commented Aug 24, 2018 reply Follow Share Is the answer 6? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes yes its answer is 6 state in minimal dfa Chandrabhan Vishwa 1 answered Aug 24, 2018 Chandrabhan Vishwa 1 comment Share Follow See 1 comment See all 1 1 comment reply Anurag Parothia 1 commented Aug 25, 2018 reply Follow Share I also know in this manner but it is not coming on my mind using table construction method but eventually i get that , and Thanks for your answer 0 votes 0 votes Please log in or register to add a comment.