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.