The lexicographically least de Bruijn cycle
From MaRDI portal
Publication:5597538
DOI10.1016/S0021-9800(70)80050-3zbMath0199.31702MaRDI QIDQ5597538
Publication date: 1970
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Related Items
Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking, On the de Bruijn torus problem, Longest subsequences shared by two de Bruijn sequences, A class of nonlinear de Bruijn cycles, Lexicographic compositions and de Bruijn sequences, Constructing de Bruijn sequences by concatenating smaller universal cycles, Constructive theorems for the truth table of the Ford sequence, Generation of the Ford sequence of length \(2^ n\), n large, Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles, Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence