A universal cycle for strings with fixed-content (which are also known as multiset permutations)
From MaRDI portal
Publication:832908
DOI10.1007/978-3-030-83508-8_43OpenAlexW3193102863MaRDI QIDQ832908
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_43
gray codemultiset permutationde Bruijn cyclenecklaceuniversal cyclecool-lexParikh vectorfixed-content
Related Items (3)
Enumerations of universal cycles for \(k\)-permutations ⋮ Flip-swap languages in binary reflected Gray code order ⋮ Constructing the first (and coolest) fixed-content universal cycle
Cites Work
- Unnamed Item
- Unnamed Item
- The lexicographically smallest universal cycle for binary strings with minimum specified weight
- Binary bubble languages and cool-lex order
- Universal cycles of classes of restricted words
- Symmetry types of periodic sequences
- Efficient universal cycle constructions for weak orders
- Universal cycles for permutations
- Research problems on Gray codes and universal cycles
- An algorithm for generating necklaces of beads in two colors
- Lexicographically least circular substrings
- Universal cycles for combinatorial structures
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- A fast algorithm to generate necklaces with fixed content
- Shorthand universal cycles for permutations
- A framework for constructing de Bruijn sequences via simple successor rules
- Graph universal cycles of combinatorial objects
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- Universal Cycles for Weight-Range Binary Strings
- Universal Cycles for Weak Orders
- De Bruijn Sequences for Fixed-Weight Binary Strings
- De Bruijn Sequences for the Binary Strings with Maximum Density
- A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
This page was built for publication: A universal cycle for strings with fixed-content (which are also known as multiset permutations)
