| Issue |
RAIRO-Theor. Inf. Appl.
Volume 59, 2025
Generation, enumeration and tiling
|
|
|---|---|---|
| Article Number | 16 | |
| Number of page(s) | 14 | |
| DOI | https://doi.org/10.1051/ita/2025014 | |
| Published online | 07 November 2025 | |
Efficient Generation of some Greedy Binary Gray codes
1
LIB, Université Bourgogne Europe, Dijon, France
2
Polytechnic University Macao, China
* Corresponding author: vvajnov@u-bourgogne.fr
Received:
26
February
2025
Accepted:
16
September
2025
In 2013, Aaron Williams introduced the notion of a greedy Gray code algorithm and reinterpreted known Gray codes in a unified manner using greedy algorithms. Recently, this notion was further generalized and investigated by Merino, Mütze, and Williams in 2022, and by Merino and Mütze in 2024, in the context of generating the bases of a matroid or the spanning trees of a graph, among other combintorial structures. In this article, we investigate the existence of homogeneous greedy Gray codes for Fibonacci words and generalized Dyck prefixes. We also establish useful properties and provide efficient generation algorithms for them.
Mathematics Subject Classification: 05A05 / 05A10 / 68R15
Key words: Gray codes / efficient generation / greedy algorithms
© The authors. Published by EDP Sciences, 2025
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.