Greedy Gray Codes for some Restricted Classes of Binary Words
<|reference_start|>Greedy Gray Codes for some Restricted Classes of Binary Words: 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.<|reference_end|>
@article{hassler2024greedy,
    title={Greedy Gray Codes for some Restricted Classes of Binary Words},
    author={Nathana"el Hassler, Vincent Vajnovszki, Dennis Wong},
    journal={EPTCS 403, 2024, pp. 108-112},
    year={2024},
    doi={10.4204/EPTCS.403.23},
    archivePrefix={arXiv},
    eprint={2406.16405},
    primaryClass={cs.DM cs.DS math.CO}
}