Binary de Bruijn cycles under different equivalence relations
From MaRDI portal
Publication:1974523
DOI10.1016/S0012-365X(99)00230-7zbMath0955.68091MaRDI QIDQ1974523
Publication date: 27 July 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (4)
Designing preference functions for de Bruijn sequences with forbidden words ⋮ The lexicographically smallest universal cycle for binary strings with minimum specified weight ⋮ Particular cycles of a binary de Bruijn digraph ⋮ De Bruijn Sequences for the Binary Strings with Maximum Density
This page was built for publication: Binary de Bruijn cycles under different equivalence relations