Gray code order for Lyndon words

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...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics and theoretical computer science Vol. 9 no. 2; no. 2; pp. 145 - 151
Main Author Vajnovszki, Vincent
Format Journal Article
LanguageEnglish
Published Nancy DMTCS 01.01.2007
Discrete Mathematics & Theoretical Computer Science
Subjects
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Computer Science
Discrete Mathematics
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.393