DeepAI AI Chat
Log In Sign Up

Gray codes for Fibonacci q-decreasing words

by   Jean-Luc Baril, et al.

An n-length binary word is q-decreasing, q≥ 1, if every of its length maximal factor of the form 0^a1^b satisfies a=0 or q· a > b.We show constructively that these words are in bijection with binary words having no occurrences of 1^q+1, and thus they are enumerated by the (q+1)-generalized Fibonacci numbers. We give some enumerative results and reveal similarities between q-decreasing words and binary words having no occurrences of 1^q+1 in terms of frequency of 1 bit. In the second part of our paper, we provide an efficient exhaustive generating algorithm for q-decreasing words in lexicographic order, for any q≥ 1, show the existence of 3-Gray codes and explain how a generating algorithm for these Gray codes can be obtained. Moreover, we give the construction of a more restrictive 1-Gray code for 1-decreasing words, which in particular settles a conjecture stated recently in the context of interconnection networks by Eğecioğlu and Iršič.


page 1

page 2

page 3

page 4


Asymptotic bit frequency in Fibonacci words

It is known that binary words containing no k consecutive 1s are enumera...

Finding Short Synchronizing Words for Prefix Codes

We study the problems of finding a shortest synchronizing word and its l...

Fibonacci-like sequences for variants of the tower of Hanoi, and corresponding graphs and gray codes

We modify the rules of the classical Tower of Hanoi puzzle in a quite na...

Complete Variable-Length Codes: An Excursion into Word Edit Operations

Given an alphabet A and a binary relation τ⊆ A * x A * , a language X ⊆ ...

ℚ-bonacci words and numbers

We present a quite curious generalization of multi-step Fibonacci number...

Borders, Palindrome Prefixes, and Square Prefixes

We show that the number of length-n words over a k-letter alphabet havin...

On Prefix Normal Words

We present a new class of binary words: the prefix normal words. They ar...