摘要
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.
| 原文 | English |
|---|---|
| 頁(從 - 到) | 108-112 |
| 頁數 | 5 |
| 期刊 | Electronic Proceedings in Theoretical Computer Science, EPTCS |
| 卷 | 403 |
| DOIs | |
| 出版狀態 | Published - 24 6月 2024 |
| 事件 | 13th Conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, GASCom 2024 - Bordeaux, France 持續時間: 24 6月 2024 → 28 6月 2024 |
指紋
深入研究「Greedy Gray Codes for some Restricted Classes of Binary Words」主題。共同形成了獨特的指紋。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver