A Combinatorial Game and an Efficiently Computable Shift Rule for the Prefer Max De Bruijn Sequence

Yotam Svoray, Gera Weiss

Research output: Contribution to journalArticle

Abstract

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.
Original languageEnglish GB
JournalArxiv preprint
Issue number1805.02405 [cs.DM]
StatePublished - 2018

Cite this