Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442)

From MaRDI portal
Revision as of 19:38, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence
scientific article

    Statements

    title
    Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (English)
    0 references
    author
    Tomasz Kociumaka
    0 references
    Jakub Radoszewski
    0 references
    Wojciech Rytter
    0 references
    publication date
    28 October 2016
    0 references
    zbMATH Keywords
    Lyndon word
    0 references
    de Bruijn sequence
    0 references
    necklaces
    0 references
    deterministic finite automaton
    0 references
    efficient algorithm
    0 references
    cites work
    Algorithms on Strings
    0 references
    Q4849531
    0 references
    Q5834367
    0 references
    Q4023676
    0 references
    Q4681162
    0 references
    Q4341774
    0 references
    On Burnside's Problem
    0 references
    Q3154677
    0 references
    Generating necklaces
    0 references

    Identifiers

    DOI
    10.1137/15M1043248
    0 references
    Mathematics Subject Classification ID
    68R15
    0 references
    68Q25
    0 references
    68Q45
    0 references
    68W32
    0 references
    zbMATH DE Number
    6645260
    0 references
    arXiv ID
    1510.02637
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2830442&oldid=36283570"
    Powered by MediaWiki