SIMULATABILITY OF FINITE AUTOMATA BY SCHEPHERDSON AND STURGIS' MACHINES
Seiiti Huzino · Memoirs of the Faculty of Science Kyushu University Series A Mathematics · 1966
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.