User

Build a DFA for the following language L$=\{$x over $\{$a$,$ b$\}|$ x contains both substrings aa and bb$\}$ and draw a state diagram with circles representing states and arrows representing transitions. The Start state is indicated by an arrow pointing to it from nowhere, and the accept stae is indicated by a double circle.