Gray code order for Lyndon words

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-00966527
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Wednesday, March 26, 2014 - 5:01:32 PM
Last modification on : Saturday, July 14, 2018 - 1:06:29 AM
Long-term archiving on : Thursday, June 26, 2014 - 12:00:24 PM

File

661-2324-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00966527, version 1

Collections

Citation

Vincent Vajnovszki. Gray code order for Lyndon words. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (2), pp.145--151. ⟨hal-00966527⟩

Share

Metrics

Record views

161

Files downloads

579