%0 Journal Article
%T Gray Code Order for Lyndon Words
%A Vincent Vajnovszki
%J Discrete Mathematics & Theoretical Computer Science
%D 2007
%I Discrete Mathematics & Theoretical Computer Science
%X At the 4 th 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.
%U http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/661