# Can we have more than one Deterministic Finite Automata diagrams for a set of strings? [closed]

Much like many math equations can be simplified. I am wondering if Deterministic Finite Automata diagrams can equal each other while some may be more simplified than others. I am following the youtube video and I am wondering if the graph that I drew with pencil and paper would also be correct. Given the Prompt:

Construct a DFA that accepts any strings over {a,b} that does not contain the string aabb in it.