Post a New Question


posted by on .

Each of the following language 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  sigma={a,b}
g. {w|w is any string that doesn't contain exactly two a's}
h.{w|w is any string except a and b}.

Answer This Question

First Name:
School Subject:

Related Questions

More Related Questions

Post a New Question