# Question: construct a dfa and a regular expression for the language...

###### Question details

Construct a DFA and a regular expression for the language L = {x ∈ {0,1}∗ | x contains a substring “100” }. Give as much detail as possible. Then construct a DFA and a regular expression for the language L = {x ∈ {0, 1}∗ | length of x is not divisible by 3}. Give as much detail as possible. After compare them and explain if the difference between the two if any?