The lexicographically least de Bruijn cycle

DOI10.1016/S0021-9800(70)80050-3zbMath0199.31702MaRDI QIDQ5597538

Harold Fredricksen

Publication date: 1970

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

combinatorics

Related Items (10)

Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking ⋮ Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles ⋮ Constructing de Bruijn sequences by concatenating smaller universal cycles ⋮ On the de Bruijn torus problem ⋮ A class of nonlinear de Bruijn cycles ⋮ Lexicographic compositions and de Bruijn sequences ⋮ Constructive theorems for the truth table of the Ford sequence ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence ⋮ Generation of the Ford sequence of length \(2^ n\), n large ⋮ Longest subsequences shared by two de Bruijn sequences

This page was built for publication: The lexicographically least de Bruijn cycle