On a theorem of gács
Ion Măndoiu · International Journal of Computer Mathematics · 1993
In this paper we extend a theorem of Gács to arbitrary alphabets. An interesting consequence of this theorem shows that there is a deterministic algorithm which can obtain every infinite sequence from a random one.