Sir ,

if it was a set of all Finite Automatons over {0,1} , what would the answer be ?

As each regular expression can be represented by a FAs and as set of regular expressions are countable, set of FAs are also countable .

Is my reasoning correct ?

if it was a set of all Finite Automatons over {0,1} , what would the answer be ?

As each regular expression can be represented by a FAs and as set of regular expressions are countable, set of FAs are also countable .

Is my reasoning correct ?