L(NFA) is countable because there is a countable number of possible NFAs over a finite alphabet, and each NFA recognizes a finite language. Therefore, the union of all languages recognized by NFAs must be a countable set.Read less