# Can a language have more than one DFA?

For Example when we consider a DFA that allows the strings having neither sub strings 00 or 11 I can produce the following two DFAs:

-

To be even more specific: it's infinite up to isomorphism when the states are a subset of a fixed set, e.g. $\mathbb{N}$. If we don't fix that, the collection of automata is not even a set... Somehow I don't think this was the intention of the OP :) – Shaull Feb 4 at 9:59