Notes on de Bruijn sequences
In this paper the concepts of look-up table, look-up table labels and mini-cycle set are introduced and used to present some algorithms for generating the greatest de Bruijn sequence DB(m,n) and all DB(m,n)'s. Also these algorithms are compared with the Martin algorithm and backtracking algorithms. In the appendix an algorithm for numerically generating r arrangements of n objects is presented.
scientific article; zbMATH DE number 4005633