Section 1.9 Binary Strings of the textbook Introduction to Lattices and Order, second edition, by Davey and Priestley, says the following:
Let $\Sigma^\ast$ be the set of all finite binary strings, that is, all finite sequences of zeros and ones; the empty string is included. Adding the infinite sequences, we get the set of all finite or infinite sequences, which we denote $\Sigma^{\ast \ast}$.
I'm confident that, as alluded to, the set of all finite binary strings is a set of infinite sequences (in terms of the amount of finite sequences in the set). But does adding all of these sequences, which, as stated, would be an infinite amount of sequences, actually get us the set of all infinite sequences, as it claims? It intuitively seems like it would be true, but intuition is often wrong when reasoning about infinity in such ways, so I'm not totally sure.