Draw DFA

Question

Represent the language over

∑={0,1} containing all possible combinations of 0's and 1's but not having two consecutive 0's.

Along with language please explain the DFA too.

Answer 1

Here Given language is containing all possible combination of 0's and 1's but not 2 consecutive 0's.

It means it accept all the strings other than which has 2 consecutive 0's.A string which has 2 consecutive 0's will lead to dead state.It will accept single 0 ,1 and ∈ too.

L={∈,0,1,10,01,101,.......}