Abstract
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.
C.R. CATEGORIES::
International Journal of Computer Mathematics
Volume 48, 1993 - Issue 3-4
![Sample our Bioscience journals, sign in here to start your access, Latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5925/TOC-Subject-Sample-2021-Bioscience.jpg"})