Lexicographic compositions and de Bruijn sequences
From MaRDI portal
(Redirected from Publication:1232525)
Cites work
- A class of nonlinear de Bruijn cycles
- A problem in arrangements
- An algorithm for generating necklaces of beads in two colors
- Generation of the Ford sequence of length \(2^ n\), n large
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- The lexicographically least de Bruijn cycle
Cited in
(19)- An algorithm for generating necklaces of beads in two colors
- Generation of some de Bruijn sequences
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- An efficient shift rule for the prefer-max de Bruijn sequence
- A framework for constructing de Bruijn sequences via simple successor rules
- Investigating the discrepancy property of de Bruijn sequences
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
- Binary quadratic forms as dessins
- Rice's theorem for -limit sets of cellular automata
- Combinatorics of Boolean automata circuits dynamics
- DE BRUIJN SEQUENCES REVISITED
- \(\mu\)-limit sets of cellular automata from a computational complexity perspective
- A surprisingly simple de Bruijn sequence construction
- On the de Bruijn torus problem
- De Bruijn sequences: from games to shift-rules to a proof of the Fredricksen-Kessler-Maiorana theorem
- Efficient constructions of the prefer-same and prefer-opposite de Bruijn sequences
- A simple shift rule for \(k\)-ary de Bruijn sequences
- Yamatárájabhánasalagám (the rhythm of de Bruijn's successions)
This page was built for publication: Lexicographic compositions and de Bruijn sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1232525)
