
Gray codes for Fibonacci qdecreasing words
An nlength binary word is qdecreasing, q≥ 1, if every of its length ma...
read it

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
A prefix normal word is a binary word with the property that no substrin...
read it

New Bounds on Antipowers in Binary Words
Fici et al. defined a word to be a kpower if it is the concatenation of...
read it

A Note on Squares in Binary Words
We consider words over a binary alphabet. A word w is overlapfree if it...
read it

Circularly squarefree words and unbordered conjugates: a new approach
Using a new approach based on automatic sequences, logic, and a decision...
read it

On Prefix Normal Words
We present a new class of binary words: the prefix normal words. They ar...
read it

On a combinatorial generation problem of Knuth
The wellknown middle levels conjecture asserts that for every integer n...
read it
Asymptotic bit frequency in Fibonacci words
It is known that binary words containing no k consecutive 1s are enumerated by kstep Fibonacci numbers. In this note we discuss the expected value of a random bit in a random word of length n having this property. This expectation can reveal new properties of some telecommunication protocols or interconnection networks.
READ FULL TEXT
Comments
There are no comments yet.