On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs

An n-th order k-ary de Bruijn sequence is a cyclic sequence of length \(k^{n}\) which contains every possible k-ary subsequence of length n exactly once during each period. In this paper, we show that, if we fix the initial n bits, any n-th order de Bruijn sequence can be transformed to another using a sequence of transformations.