What is the minimal DFA for this language (11+111)*, for Σ={0,1}.

Question

What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?

Answer 1

language accpted will be {£,11,111,1111,11111,......................} 

dfa will have 4 states 

For nfa remove the dead stage and correspondong edges