DeepAI AI Chat
Log In Sign Up

An Efficient Generalized Shift-Rule for the Prefer-Max De Bruijn Sequence

by   Gal Amram, et al.

One of the fundamental ways to construct De Bruijn sequences is by using a shift-rule. A shift-rule receives a word as an argument and computes the digit that appears after it in the sequence. An optimal shift-rule for an (n,k)-De Bruijn sequence runs in time O(n). We propose an extended notion we name a generalized-shift-rule, which receives a word, w, and an integer, c, and outputs the c digits that comes after w. An optimal generalized-shift-rule for an (n,k)-De Bruijn sequence runs in time O(n+c). We show that, unlike in the case of a shift-rule, a time optimal generalized-shift-rule allows to construct the entire sequence efficiently. We provide a time optimal generalized-shift-rule for the well-known prefer-max and prefer-min De Bruijn sequences.


page 1

page 2

page 3

page 4


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

We present a two-player combinatorial game over a k-ary shift-register a...

Complexity of Shift Bribery in Committee Elections

We study the (parameterized) complexity of SHIFT BRIBERY for multiwinner...

A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence

We propose a novel construction for the well-known prefer-max De Bruijn ...

Approximation and Hardness of Shift-Bribery

In the Shift-Bribery problem we are given an election, a preferred candi...

Cut-Down de Bruijn Sequences

A cut-down de Bruijn sequence is a cyclic string of length L, where 1 ≤ ...

Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences

The linear complexity of a sequence s is one of the measures of its pred...

Generalized Word Shift Graphs: A Method for Visualizing and Explaining Pairwise Comparisons Between Texts

A common task in computational text analyses is to quantify how two corp...