At the 4th Conference on Combinatorics on Words, Christophe Reutenauer posed the question of whether the dual reflected order yields a Gray code on the Lyndon family. In this paper we give a positive answer. More precisely, we present an O(1)-average-time algorithm for generating length n binary pre-necklaces, necklaces and Lyndon words in Gray code order
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
International audienceWe first give a fast algorithm to compute the maximal Lyndon word (with respec...
At the 4 th Conference on Combinatorics on Words, Christophe Reutenauer posed the question of whet...
the dual re ected order yields a Gray code on the Lyndon family. In this paper we give a positive an...
International audienceAt the 4th Conference on Combinatorics on Words, Christophe Reutenauer posed t...
International audienceAt the 4th Conference on Combinatorics on Words, Christophe Reutenauer posed t...
A counting sequence of length n is a list of all 2^n binary n-tuples (binary codewords of length n)....
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming dista...
AbstractThe average cost of Duval's algorithm for generating all Lyndon words up to a given length i...
AbstractWe give the first Gray code for the set of n-length permutations with a given number of cycl...
RésuméEtant donné un alphabet ordonné, un mot de Lyndon est un mot primitif qui est le plus petit da...
In this paper we extend previous work on unique maximal factorization families (UMFFs) and a total (...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
Graduation date: 2008An n-bit Gray code is an ordered set of all 2n binary strings of length n. The\...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
International audienceWe first give a fast algorithm to compute the maximal Lyndon word (with respec...
At the 4 th Conference on Combinatorics on Words, Christophe Reutenauer posed the question of whet...
the dual re ected order yields a Gray code on the Lyndon family. In this paper we give a positive an...
International audienceAt the 4th Conference on Combinatorics on Words, Christophe Reutenauer posed t...
International audienceAt the 4th Conference on Combinatorics on Words, Christophe Reutenauer posed t...
A counting sequence of length n is a list of all 2^n binary n-tuples (binary codewords of length n)....
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming dista...
AbstractThe average cost of Duval's algorithm for generating all Lyndon words up to a given length i...
AbstractWe give the first Gray code for the set of n-length permutations with a given number of cycl...
RésuméEtant donné un alphabet ordonné, un mot de Lyndon est un mot primitif qui est le plus petit da...
In this paper we extend previous work on unique maximal factorization families (UMFFs) and a total (...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
Graduation date: 2008An n-bit Gray code is an ordered set of all 2n binary strings of length n. The\...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
We consider Gray codes and efficient exhaustive generating algorithms for the sets belonging to thre...
International audienceWe first give a fast algorithm to compute the maximal Lyndon word (with respec...
DOI
Add to ORKG