Each of the following languages is the complement of a simpler language. In each part, construct a DFA for the simpler language, then use it to give the state diagram of a DFA for the language given. In all parts, Σ = {a, b}.{w| w does not contain the substring ab} {w| w does not contain the substring baba} {w| w contains neither the substrings ab nor ba} {w| w is any string not in a∗ ∪ b∗ } ( ∪ is the union )

Question

Each of the following languages is the complement of a simpler language. In each part, construct a DFA for the simpler language, then use it to give the state diagram of a DFA for the language given. In all parts, Σ = {a, b}.