Greedy Gray Codes for some Restricted Classes of Binary Words
Discrete Mathematics
2024-06-25 v1 Data Structures and Algorithms
Combinatorics
Abstract
We investigate the existence of greedy Gray codes, based on the choice of the first element in the code, for two classes of binary words: generalized Fibonacci words and generalized Dyck words.
Cite
@article{arxiv.2406.16405,
title = {Greedy Gray Codes for some Restricted Classes of Binary Words},
author = {Nathanaël Hassler and Vincent Vajnovszki and Dennis Wong},
journal= {arXiv preprint arXiv:2406.16405},
year = {2024}
}
Comments
In Proceedings GASCom 2024, arXiv:2406.14588