Programming techniques are given by which two programms can be constructed to simulate behaviors of finite automata by Schepherdson and Sturgis' machines. The l-weak simulatability is defined as a natural consequence of consideration.
By making use of the programming technique developed in [1], we shall study a problem whether a given real-time Turing machine with k work-tapes is simulatable by a modified Schepherdson-Sturgis' machine or not, and give an affirmative solution of the question by constructing a simulation program in such a machine.