Greedy Gray Codes for some Restricted Classes of Binary Words
arXiv:2406.16405 · doi:10.4204/EPTCS.403.23
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.
In Proceedings GASCom 2024, arXiv:2406.14588