Lemma: If A is an at most countable alphabet, then the set A^* of strings over A is countable.
Proof begin:
Let p_n be the n^{th} prime number: p_0 = 2, p_1=3, p_2=5, and so on. If A is finite, say A = {a_0, a_1, ... , a_n}, where a_0, a_1, ... , a_n are pairwise distinct, or if A is countable...