Generating cyclic rotation Gray codes for stamp foldings and semi-meanders

DOI10.1007/978-3-031-34347-6_23OpenAlexW4379134745MaRDI QIDQ6182911

No author found.

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-34347-6_23

zbMATH Keywords

Gray codebinary reflected Gray codemeandersreflectable languagesemi-meandersCAT Algorithmstamp foldings

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Stamp foldings, semi-meanders, and open meanders: fast generation algorithms
• Gray codes for reflectable languages
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order
• Flip-swap languages in binary reflected Gray code order
• Foldings and Meanders
• A fast algorithm to generate open meandric systems and meanders
• Arithmetic and analytic properties of paper folding sequences
• A transfer matrix approach to the enumeration of plane meanders
• Sorting jordan sequences in linear time using level-linked search trees
• Folding a strip of stamps
• A Map-Folding Problem
• Contribution a L'etude Du Probleme Des Timbres Poste
• Combinatorial Gray codes -- an updated survey

This page was built for publication: Generating cyclic rotation Gray codes for stamp foldings and semi-meanders