%I #4 Apr 30 2017 11:30:16
%S 1,1,1,1,0,0,1,0,1,1,1,1,1,1,0,0,1,0,1,1,1,1,1,1,0,0,1,0,1,1,1,1,1,1,
%T 0,0,1,0,1,1,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,1,1,1,1,0,0,1,0,1,1,0,0,
%U 1,0,0,0,1,0,1,1,1,1,0,0,1,0,1,1,1,1
%N 1-limiting word of the morphism 0->11, 1-> 0010.
%C The morphism 0->11, 1-> 0010 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 11 -> 00100010 -> 11110010111111001011 -> 001000100010001011... ; if the number of iterations is odd, the 1-word evolves from 0 -> 11 -> 00100010 -> 11110010111111001011, as in A285498.
%H Clark Kimberling, <a href="/A285498/b285498.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {1, 1}, 1 -> {0, 0, 1, 0}}] &, {0}, 11] (* A285498 *)
%t Flatten[Position[s, 0]] (* A285499 *)
%t Flatten[Position[s, 1]] (* A285500 *)
%Y Cf. A285495, A285499, A285500.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Apr 30 2017