The coolest way to generate binary strings (Q489746): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6388509 / rank
 
Normal rank
Property / zbMATH Keywords
 
cool-lex order
Property / zbMATH Keywords: cool-lex order / rank
 
Normal rank
Property / zbMATH Keywords
 
Gray code
Property / zbMATH Keywords: Gray code / rank
 
Normal rank
Property / zbMATH Keywords
 
binary strings
Property / zbMATH Keywords: binary strings / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorics on words
Property / zbMATH Keywords: combinatorics on words / rank
 
Normal rank
Property / zbMATH Keywords
 
necklace prefix algorithm
Property / zbMATH Keywords: necklace prefix algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
FKM algorithm
Property / zbMATH Keywords: FKM algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
de Bruijn sequence
Property / zbMATH Keywords: de Bruijn sequence / rank
 
Normal rank
Property / zbMATH Keywords
 
universal cycle
Property / zbMATH Keywords: universal cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamming distance
Property / zbMATH Keywords: Hamming distance / rank
 
Normal rank
Property / zbMATH Keywords
 
Levenshtein distance
Property / zbMATH Keywords: Levenshtein distance / rank
 
Normal rank

Revision as of 22:26, 30 June 2023

scientific article
Language Label Description Also known as
English
The coolest way to generate binary strings
scientific article

    Statements

    The coolest way to generate binary strings (English)
    0 references
    0 references
    0 references
    21 January 2015
    0 references
    cool-lex order
    0 references
    Gray code
    0 references
    binary strings
    0 references
    combinatorics on words
    0 references
    necklace prefix algorithm
    0 references
    FKM algorithm
    0 references
    de Bruijn sequence
    0 references
    universal cycle
    0 references
    Hamming distance
    0 references
    Levenshtein distance
    0 references

    Identifiers