|
%I #13 Feb 27 2020 22:48:13
%S 0,1,0,1,1,0,0,1,0,1,0,0,1,0,0,1,1,0,0,1,0,0,0,0,0,1,0,0,1,0,0,1,0,1,
%T 0,0,1,0,0,1,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,1,0,0,1,0,0,1,1,0,0,1,
%U 0,0,0,0,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,1
%N In A316831, replace 2's and 3's with 0's.
%H A. Cobham, <a href="https://doi.org/10.1109/SWAT.1968.20">On the Hartmanis-Stearns problem for a class of tag machines</a>, 9th Annual Symposium on Switching and Automata Theory (SWAT 1968)(FOCS), pp. 51-60, 1968; doi:10.1109/SWAT.1968.20. See Example 7.
%t Nest[ Flatten[# /. {0 -> {0, 1}, 1 -> {2, 1}, 2 -> {1, 3}, 3 -> {3, 3}}] &, {0}, 7] /. {2 -> 0, 3 -> 0} (* _Robert G. Wilson v_, Jul 18 2018 *)
%Y Cf. A316831, A086747.
%K nonn
%O 0
%A _N. J. A. Sloane_, Jul 18 2018
|
