Algorithms for Generating de Bruijn Sequences by Reducing a Stage
Xie Shen-quan · Journal of Chinese Computer Systems · 2009
An algorithm for generating de Bruijn sequences by reducing a stage is discussed. The method is finding the n-1 stage Look-up table labels of n-1 stage de Bruijn sequences from an n stage de Bruijn sequence; obtaining the n-1 stage Look-up table labels by deleting the first symbol of corresponding nodes, verifying the validity of the n-2 stage node chain, finding and deleting knots on the node chains; then constructing the relative n-1 stage Look-up table and computing n-1 stage de Bruijn sequences with this Look-up table. Finally, some comments are given.