An Algorithm for the Generation of \(M\)-Sequences using Universal Circuit Matrix

The design of de Bruijn sequences is equivalent to finding spanning trees in certain graphs. We give an algorithm which finds spanning
trees in these graphs using the universal circuit matrix defined in \([9]\).