2 votes 2 votes The number of states in a minimal finite automata accepting the empty set is_________. Theory of Computation theory-of-computation finite-automata + – Nisha kumari asked Nov 9, 2015 Nisha kumari 1.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes 1. All strings go to one state- the reject state - there is only 1 class as per Myhill-Nerode theorem and DFA also has just 1 state and no final state. Arjun answered Nov 9, 2015 • selected Nov 9, 2015 by Pooja Palod Arjun comment Share Follow See all 4 Comments See all 4 4 Comments reply focus _GATE commented Nov 9, 2015 reply Follow Share sir here empty set means nothing?? 0 votes 0 votes Arjun commented Nov 9, 2015 reply Follow Share yes.. that's why it is empty- {}. For empty string, the language contains one string. So, we will need one accept state and one reject. 1 votes 1 votes Yash Gupta commented Nov 9, 2015 reply Follow Share but for this language no alphabet r defined. So, isn't this language contain only a empty string?? 0 votes 0 votes Arjun commented Jan 8, 2016 reply Follow Share No alphabet set defined does not imply that. We cannot assume $\Sigma = \{\}$ just because it is not defined. Usually if something is not defined means- it can be anything. 0 votes 0 votes Please log in or register to add a comment.
