Generating Cyclic Rotation Gray Codes for Stamp Foldings and Semi-meanders

Bowie Liu, Dennis Wong

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a simple algorithm that generates cyclic rotation Gray codes for stamp foldings and semi-meanders, where consecutive strings differ by a stamp rotation. These are the first known Gray codes for stamp foldings and semi-meanders, and we thus solve an open problem posted by Sawada and Li in [Electron. J. Comb. 19(2), 2012]. The algorithm generates each stamp folding and semi-meander in constant amortized time and O(n)-amortized time per string respectively, using a linear amount of memory.

Original languageEnglish
Title of host publicationCombinatorial Algorithms - 34th International Workshop, IWOCA 2023, Proceedings
EditorsSun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee
PublisherSpringer Science and Business Media Deutschland GmbH
Pages271-281
Number of pages11
ISBN (Print)9783031343469
DOIs
Publication statusPublished - 2023
Event34th International Workshop on Combinatorial Algorithms, IWOCA 2023 - Tainan, Taiwan, Province of China
Duration: 7 Jun 202310 Jun 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13889 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference34th International Workshop on Combinatorial Algorithms, IWOCA 2023
Country/TerritoryTaiwan, Province of China
CityTainan
Period7/06/2310/06/23

Keywords

  • Binary reflected Gray code
  • CAT algorithm
  • Gray code
  • Meanders
  • Reflectable language
  • Semi-meanders
  • Stamp foldings

Fingerprint

Dive into the research topics of 'Generating Cyclic Rotation Gray Codes for Stamp Foldings and Semi-meanders'. Together they form a unique fingerprint.

Cite this