1 votes 1 votes No of State for minimal DFA for empty language ? If your answer is 1 or 2 then please explain to support your answer Abhi Som asked Aug 9, 2017 Abhi Som 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes Only one state is required. And it will be the starting state, all transitions go from this state to itself. And there will be no final state. Rishabh Gupta 2 answered Aug 9, 2017 • selected Aug 11, 2017 by Praveen Saini Rishabh Gupta 2 comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Praveen Saini commented Aug 11, 2017 reply Follow Share @abhi , design any dfa with any no of states for language L={ } with/without final state , (if there is any final state in dfa for L={ }, then that will be either unreachable from start state or L is non empty ,then unreachable states need to remove from dfa to minimize), then apply myhill-nerode to find equivalence states. 0 votes 0 votes Abhi Som commented Aug 11, 2017 reply Follow Share Pura pado .... Wikipedia pe .... No of equivalence class on set (language L) is equal to the states in minimal DFA of L ... 0 votes 0 votes Abhi Som commented Aug 11, 2017 reply Follow Share @praveen .... If one state used to create minimal DFA of empty language then there have to be one equivalence class ..... True... Then empty language have to follow equivalence relation .... But it don't.... It is not reflexive... 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes One non-final state, which will also act as start state and transitions of that state from the specified input symbols to itself. just_bhavana answered Aug 9, 2017 just_bhavana comment Share Follow See 1 comment See all 1 1 comment reply Abhi Som commented Aug 13, 2017 reply Follow Share Bhavana, AAP saare comments padho.... 0 votes 0 votes Please log in or register to add a comment.