Pages that link to "Item:Q1248514"
From MaRDI portal
The following pages link to Necklaces of beads in k colors and k-ary de Bruijn sequences (Q1248514):
Displayed 50 items.
- Necklaces and bracelets in R (Q99679) (← links)
- Generalized Fibonacci recurrences and the lex-least de Bruijn sequence (Q384938) (← links)
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time (Q391391) (← links)
- Boltzmann samplers for \(v\)-balanced cycles (Q391394) (← links)
- Lyndon words and Fibonacci numbers (Q392802) (← links)
- Linear computation of unbordered conjugate on unordered alphabet (Q393901) (← links)
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- Corrigendum to ``On the theorem of Fredricksen and Maiorana about de Bruijn sequences'' (Q472929) (← links)
- The coolest way to generate binary strings (Q489746) (← links)
- A surprisingly simple de Bruijn sequence construction (Q501039) (← links)
- 2D Lyndon words and applications (Q513297) (← links)
- Burrows-Wheeler transformations and de Bruijn words (Q714849) (← links)
- A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
- The Collatz conjecture and de Bruijn graphs (Q740473) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) (← links)
- Lyndon words formalized in Isabelle/HOL (Q832940) (← links)
- Lyndon + Christoffel = digitally convex (Q834259) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- Words with many palindrome pair factors (Q888638) (← links)
- de Bruijn sequences and de Bruijn graphs for a general language (Q1044740) (← links)
- Minimum Eulerian circuits and minimum de Bruijn sequences (Q1044891) (← links)
- An algorithm for generating necklaces of beads in two colors (Q1084396) (← links)
- Generation of some de Bruijn sequences (Q1144586) (← links)
- A new look at the de Bruijn graph (Q1199424) (← links)
- An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243) (← links)
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence (Q1645055) (← links)
- Constructing de Bruijn sequences by concatenating smaller universal cycles (Q1659978) (← links)
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order (Q1679610) (← links)
- Computing generalized de Bruijn sequences (Q1680534) (← links)
- The standard factorization of Lyndon words: an average point of view (Q1764900) (← links)
- A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
- Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
- On the theorem of Fredricksen and Maiorana about de Bruijn sequences (Q1883388) (← links)
- Two new optimal ternary two-weight codes and strongly regular graphs (Q1910570) (← links)
- Fractional covers for convolution products (Q1923650) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
- Investigating the discrepancy property of de Bruijn sequences (Q2075526) (← links)
- On greedy algorithms for binary de Bruijn sequences (Q2081554) (← links)
- Gray cycles of maximum length related to \(k\)-character substitutions (Q2096591) (← links)
- Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions (Q2220830) (← links)
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence (Q2279980) (← links)
- On stability of multi-valued nonlinear feedback shift registers (Q2325210) (← links)
- Charm bracelets and their application to the construction of periodic Golay pairs (Q2345628) (← links)
- Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
- Linearization of multi-valued nonlinear feedback shift registers (Q2400461) (← links)
- Test sequence construction using minimum information on the tested system (Q2498283) (← links)
- Generalized de Bruijn words for primitive words and powers (Q2515571) (← links)
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles (Q2635088) (← links)