Regular Expressions and minimisation of D.F.A


Consider the regular Language L=(11+1111+111111)* . Minimum no.of states in any D.F.A accepting L is; input={0,1}
A. 6
B. 9
C. 11
D. 13


The minimum number of states are 13.

As after accepting 2 1’s the automata will be in final state, it can be extended furthur taking 4 more 1’s again extended by 6 1’s .
So when calculated the no. Of states will be 13.
In the image there are more final states but major final states are shown.