1 votes 1 votes Consider the regular language L = (111 + 111111)*. The minimum number of states in any DFA accepting this language is : (A) 3 (B) 5 (C) 8 (D) 9 Sanjay Sharma asked Sep 20, 2017 Sanjay Sharma 1.8k views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply LeenSharma commented Sep 20, 2017 reply Follow Share 3 states 0 votes 0 votes sourav. commented Sep 20, 2017 i edited by sourav. Sep 20, 2017 reply Follow Share ***** 0 votes 0 votes Please log in or register to add a comment.
Best answer 2 votes 2 votes Given language L = (111 + 111111)* Strings , that belongs in the language $L= \left \{ \epsilon , 111,111111,111111111,......\right \}$ So, required DFA will be , LeenSharma answered Sep 20, 2017 selected Sep 20, 2017 by Sanjay Sharma LeenSharma comment Share Follow See all 3 Comments See all 3 3 Comments reply sourav. commented Sep 20, 2017 reply Follow Share I think the question is incomplete,because they have not mentioned the set of possible inputs. If the input consists of only $1$ ,then your DFA is right. On the other hand if input symbol consists of $0,1$, then My dfa is correc, as we have to take a dead configuration too, Right? 0 votes 0 votes LeenSharma commented Sep 20, 2017 reply Follow Share Input symbols are not given in the question.So We can assume language is over {1} as 0 is not mentioned anywhere. 0 votes 0 votes saxena0612 commented Sep 20, 2017 reply Follow Share @sourav. The language generated above is :{e,111,111111,111111111.......} Then i think there is not 0 transition is required? 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes note-: A is start state $4$ STATES sourav. answered Sep 20, 2017 sourav. comment Share Follow See all 0 reply Please log in or register to add a comment.