TY - UNPB
T1 - De Bruijn Sequences: From Games to Shift-Rules to a Proof of the Fredricksen-Kessler-Maiorana Theorem
AU - Amram, Gal
AU - Rubin, Amir
AU - Svoray, Yotam
AU - Weiss, Gera
PY - 2018/5/1
Y1 - 2018/5/1
N2 - We present a combinatorial game and propose efficiently computable
optimal strategies. We then show how these strategies can be translated
to efficiently computable shift-rules for the well known prefer-max and
prefer-min De Bruijn sequences, in both forward and backward directions.
Using these shift-rules, we provide a new proof of the well known
theorem by Fredricksen, Kessler, and Maiorana on De Bruijn sequences and
Lyndon words.
AB - We present a combinatorial game and propose efficiently computable
optimal strategies. We then show how these strategies can be translated
to efficiently computable shift-rules for the well known prefer-max and
prefer-min De Bruijn sequences, in both forward and backward directions.
Using these shift-rules, we provide a new proof of the well known
theorem by Fredricksen, Kessler, and Maiorana on De Bruijn sequences and
Lyndon words.
KW - Computer Science - Discrete Mathematics
KW - Mathematics - Combinatorics
U2 - 10.48550/arXiv.1805.02405
DO - 10.48550/arXiv.1805.02405
M3 - Preprint
BT - De Bruijn Sequences: From Games to Shift-Rules to a Proof of the Fredricksen-Kessler-Maiorana Theorem
ER -