Efficient universal cycle constructions for weak orders
From MaRDI portal
Publication:785821
DOI10.1016/j.disc.2020.112022zbMath1445.05007OpenAlexW3037080634MaRDI QIDQ785821
Publication date: 12 August 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.112022
Permutations, words, matrices (05A05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Related Items (2)
A universal cycle for strings with fixed-content (which are also known as multiset permutations) ⋮ Generating Gray codes for weak orders in constant amortized time
Uses Software
Cites Work
- Unnamed Item
- Universal cycles of classes of restricted words
- Greedy universal cycle constructions for weak orders
- Research problems on Gray codes and universal cycles
- Lexicographically least circular substrings
- A framework for constructing de Bruijn sequences via simple successor rules
- Universal Cycles for Weak Orders
- A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
This page was built for publication: Efficient universal cycle constructions for weak orders
