Abstract: We consider the problem of designing weakly universal codes for stationary and ergodic processes with countable alphabet and present a set of algorithms. First two algorithms use a ...