A Universal Random-Sequence Transformer

The feasibility of transforming certain random sequences into others by means of finite automata is explored. A method which departs significantly form any known previously is proposed. The suggested approach makes it possible to synthesize a universal transformer of nearly minimal complexity.