1 votes 1 votes If NFA contains n states, then the equivalent minimized DFA in best case will contain how many states? A. 0 B. n C. 1 D. (n-1) Theory of Computation gateforum-test-series theory-of-computation finite-automata + – Gupta731 asked Oct 31, 2018 • edited Mar 15, 2019 by ajaysoni1924 Gupta731 617 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply adarsh_1997 commented Oct 31, 2018 reply Follow Share nice question. is it n? 0 votes 0 votes Gupta731 commented Oct 31, 2018 reply Follow Share That's what I thought at first and fetched some negative marks :D But the answer provided is 1, no idea 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes bro, hope this helps https://gateoverflow.in/34006/can-we-find-out-minimum-numbers-of-states-in-dfa-nfa-has-states adarsh_1997 answered Oct 31, 2018 adarsh_1997 comment Share Follow See 1 comment See all 1 1 comment reply Gupta731 commented Oct 31, 2018 reply Follow Share Nice, Thank you. :) 0 votes 0 votes Please log in or register to add a comment.
