| Description |
Aperiodic 1D and 2D binary arrays from Thue-Morse, Fibonacci, Baum-Sweet, Paper-Folding (Dragon curve), and Rudin-Shapiro algorithms are generated based on user input.
Thue-Morse: g(A)=AB, g(B)=BA
Fibonacci: g(A)=AB, g(B)=A
Paper-Folding: g(AB)=AABA, g(BA)=ABBA, g(AB)=AABB, g(BB)=ABBB
Baum-Sweet: g(BB)=BBBB, g(BA)=ABBA, g(AB)=BABB, g(AA)=AABA
Rudin-Shapiro: g(A)=AC, g(B)=DC, g(C)=AB, g(D)=DB
See Macia, "The role of aperiodic order in science and technology" Rep. Prog. Phys. v69 (2006). |
