Does an infinite random sequence contain all finite sequences?

If we have a finite alphabet, with each letter having a non-zero probability of being selected, will an infinite sequence of letters selected from that alphabet contain all finite sequences of letters in the alphabet?

What is the dis/proof for this?

Solution 1:

Yes, infinitely many times. This is called the Infinite monkey theorem and it seems there are nearly as many proofs on the web as one could expect if an infinite collection of monkeys were busy typing them frantically on their typewriters/computers for an infinite amount of time.

Solution 2:

Letters are selected independently? Then the answer is YES. Look in a textbook for results on "independent" sequences for hints on how to prove it. For example, I might use the Borel-Cantelli lemma.