Let L be a regular language How many DFAs have language L E

Let L be a regular language. How many DFAs have language L ? Exactly 0. At most 2. Infinitely many. Exactly 1. Finitely many.

Solution

The answer is infinitely many.

Because If L is a regular language,then it has infinitely many DFAs which recognises it and there will be always a simplest minimal one.