%I
%S 1,0,0,1,1,1,0,1,1,1,0,1,1,1,0,1,1,1,1,0,0,1,1,1,1,0,1,0,0,1,1,1,0,1,
%T 1,1,0,1,1,1,1,0,0,1,1,1,0,1,1,1,0,1,1,1,1,0,0,1,1,1,0,1,1,1,0,1,1,1,
%U 0,1,1,1,1,0,1,0,0,1,1,1,0,1,1,1,0,1
%N 1limiting word of the morphism 0>10, 1> 0111.
%D The morphism 0>10, 1> 0111 has two limiting words. If the number of iterations is even, the 0word evolves from 0 > 10 > 011110 > 10011101110111011110 >
%D 01111010011101110111100111011101111001110111011110011101110111011110; if the number of iterations is odd, the 1word evolves from 0 > 10 > 011110 > 10011101110111011110, as in A285277.
%H Clark Kimberling, <a href="/A285277/b285277.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 > {1, 0}, 1 > {0, 1, 1, 1}}] &, {0}, 9]; (* A285277 *)
%t Flatten[Position[s, 0]]; (* A285278 *)
%t Flatten[Position[s, 1]]; (* A285279 *)
%Y Cf. A285275, A285278, A285279.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 25 2017
