%I #5 Apr 09 2017 22:34:56
%S 0,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,
%T 1,0,1,1,1,0,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,0,1,1,
%U 1,0,1,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1
%N 0-limiting word of the morphism 0->1, 1-> 0111.
%C The morphism 0->1, 1->0111 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 1 -> 0111 -> 10111001110111 -> 01111011101110111110111011101111011101110111; if the number of iterations is odd, the 1-word evolves from 0 -> 1 -> 0111 -> 10111001110111, as in A284677.
%H Clark Kimberling, <a href="/A284674/b284674.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1}, 1 -> {0, 1, 1, 1}}] &, {0}, 6] (* A284674 *)
%t Flatten[Position[s, 0]] (* A284675 *)
%t Flatten[Position[s, 1]] (* A284676 *)
%Y Cf. A284675, A284676, A284677.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 08 2017