
doi: 10.46298/dmtcs.393
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.
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], QA1-939, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Mathematics
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], QA1-939, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
