An algorithm for generating necklaces of beads in two colors (Q1084396): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5626468 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of nonlinear de Bruijn cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal factors of the de Bruijn graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Golomb's conjecture for the de Bruijn graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating and Counting the Double Adjacencies in a Pure Circulating Shift Register / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Adjacencies Between Cycles of a Circulating Shift Register / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic compositions and de Bruijn sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necklaces of beads in k colors and k-ary de Bruijn sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Full Length Nonlinear Shift Register Cycle Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:35, 17 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for generating necklaces of beads in two colors
scientific article

    Statements

    An algorithm for generating necklaces of beads in two colors (English)
    0 references
    0 references
    0 references
    1986
    0 references
    The correspondence among necklaces of beads of length n in two colours, binary cycles from a circulating register of length n and the lexicographic compositions of the integer n is established, and algorithms to generate all necklaces or some specific classes of necklaces are given.
    0 references
    0 references
    algorithms
    0 references
    necklaces
    0 references