Lexicographic compositions and de Bruijn sequences

DOI10.1016/0097-3165(77)90059-0zbMath0343.05008OpenAlexW2024334686MaRDI QIDQ1232525

Harold Fredricksen, Irving J. Kessler

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(77)90059-0

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)

Related Items (16)

An efficient shift rule for the prefer-max de Bruijn sequence ⋮ An algorithm for generating necklaces of beads in two colors ⋮ Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ Binary quadratic forms as dessins ⋮ Combinatorics of Boolean automata circuits dynamics ⋮ Generation of some de Bruijn sequences ⋮ \(\mu\)-limit sets of cellular automata from a computational complexity perspective ⋮ A surprisingly simple de Bruijn sequence construction ⋮ Rice’s Theorem for μ-Limit Sets of Cellular Automata ⋮ On the de Bruijn torus problem ⋮ DE BRUIJN SEQUENCES REVISITED ⋮ A framework for constructing de Bruijn sequences via simple successor rules ⋮ An efficient generalized shift-rule for the prefer-max de Bruijn sequence ⋮ A simple shift rule for \(k\)-ary de Bruijn sequences ⋮ Necklaces of beads in k colors and k-ary de Bruijn sequences ⋮ Investigating the discrepancy property of de Bruijn sequences

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for generating necklaces of beads in two colors
• A class of nonlinear de Bruijn cycles
• Generation of the Ford sequence of length \(2^ n\), n large
• A problem in arrangements
• The lexicographically least de Bruijn cycle

This page was built for publication: Lexicographic compositions and de Bruijn sequences