%I #5 Apr 30 2017 17:32:26

%S 0,1,0,0,0,1,0,0,1,1,0,1,0,0,1,1,1,1,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,

%T 0,1,0,0,0,1,0,0,1,1,0,1,0,0,1,1,1,1,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,

%U 1,1,0,1,0,0,1,1,1,1,1,1,0,1,0,0,1,1

%N 0-limiting word of the morphism 0->11, 1-> 0100.

%C The morphism 0->11, 1-> 0100 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 11 -> 01000100 -> 11010011111101001111 -> 01000100110100111101000100010001000100010011010011110100010001000100...; if the number of iterations is odd, the 1-word evolves from 0 -> 11 -> 01000100 -> 11010011111101001111, as in A285533.

%H Clark Kimberling, <a href="/A285530/b285530.txt">Table of n, a(n) for n = 1..10000</a>

%t s = Nest[Flatten[# /. {0 -> {1, 1}, 1 -> {0, 1, 0, 0}}] &, {0}, 8] (* A285530 *)

%t Flatten[Position[s, 0]] (* A285531 *)

%t Flatten[Position[s, 1]] (* A285532 *)

%Y Cf. A285531, A285532, A285533.

%K nonn,easy

%O 1

%A _Clark Kimberling_, Apr 30 2017