Generating Cyclic 2-Gray Codes for Fibonacci q-Decreasing Words
摘要
We present a two-stage algorithm for generating cyclic 2-Gray codes for q-decreasing words. In the first step, a simple recursive algorithm is used to generate a cyclic 2-Gray code for q-run constrained words, which are q-decreasing words that start with a 0. Then, by considering the first block of 1 s and concatenating cyclic Gray code listings of q-run constrained words of different length n, we construct the first known cyclic 2-Gray code for q-decreasing words for all positive real numbers q.