@article{dd162dde496c41c8846ada10ff28a794,
title = "A Combinatorial Game and an Efficiently Computable Shift Rule for the Prefer Max De Bruijn Sequence",
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. ",
author = "Yotam Svoray and Gera Weiss",
note = "DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.",
year = "2018",
language = "אנגלית",
journal = "arXiv preprint ",
number = "1805.02405 [cs.DM]",
}