3 votes 3 votes Minimal deterministic finite automaton for the language $L=\{0^n \mid n \geq 0, n \neq 4 \}$ will have: 1 final state among 5 states 4 final states among 5 states 1 final state among 6 states 5 final state among 6 states Theory of Computation ugcnetcse-june2015-paper3 theory-of-computation finite-automata + – go_editor asked Jul 31, 2016 edited May 26, 2020 by Arjun go_editor 6.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 6 votes 6 votes ans is D 5 final states and one non-final state as shown below in DFA Sanjay Sharma answered Aug 1, 2016 selected Aug 1, 2016 by LeenSharma Sanjay Sharma comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes D is ans. 5th state is non final . Prashant. answered Jul 31, 2016 Prashant. comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes D answer Total states in dfa will be 6 out of which 5 states will be final states L= { €, 0,00,000,00000,000000,................} focus _GATE answered Aug 1, 2016 focus _GATE comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes Given: based on the given condition that {0^n | n>=0, n!=4}L={0n4} so here the string accept by the language{∈,0,00,000} The DFA for this condition is given in the below link: And the answer is option (B) 4 final state among 5 state. jaiganeshcse94 answered Aug 1, 2016 edited Aug 2, 2016 by jaiganeshcse94 jaiganeshcse94 comment Share Follow See all 2 Comments See all 2 2 Comments reply Nandkishor3939 commented Jan 4, 2019 reply Follow Share Is the above DFA wrong?? Someone please confirm :) 0 votes 0 votes Nandkishor3939 commented Jan 4, 2019 reply Follow Share Because the DFA mentioned above donot accepts 0^5 0 votes 0 votes Please log in or register to add a comment.