Greedy Gray Codes for some Restricted Classes of Binary Words

Nathanaël Hassler, Vincent Vajnovszki, Dennis Wong

Research output: Contribution to journalConference articlepeer-review

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 languageEnglish
Pages (from-to)108-112
Number of pages5
JournalElectronic Proceedings in Theoretical Computer Science, EPTCS
Volume403
DOIs
Publication statusPublished - 24 Jun 2024
Event13th Conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, GASCom 2024 - Bordeaux, France
Duration: 24 Jun 202428 Jun 2024

Cite this