How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________
Answer will be $3$ or $6?$
Answer will be 3 assuming that $\Sigma = \{ a\}$ Or It will be $4$ if $\Sigma \supset \{ a \} $
The language $L = \Sigma^* - \{ \in,a\}$
If $\Sigma = \{ a\}$ then the Minimal DFA would look like the following :
If $\Sigma \supset \{ a \} $ then Minimal DFA will look like the above but with one Dead State extra.
@codingo1234
why 6 states??
is this language accepts $a^{5}?$
@Satbir
So, no dead state required. right??
@ Satbir yeah thanks I did not notice n>=2m(greater than sign), but if n=2m where m>=1 or n=3 then minimal dfa would have 6 states right?
64.3k questions
77.9k answers
244k comments
80.0k users