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.
Original language | English |
---|---|
Pages (from-to) | 108-112 |
Number of pages | 5 |
Journal | Electronic Proceedings in Theoretical Computer Science, EPTCS |
Volume | 403 |
DOIs | |
Publication status | Published - 24 Jun 2024 |
Event | 13th Conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, GASCom 2024 - Bordeaux, France Duration: 24 Jun 2024 → 28 Jun 2024 |