Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence

DOI10.1007/978-3-319-07566-2_21zbMath1407.68578OpenAlexW275506934MaRDI QIDQ5165606

Tomasz Kociumaka, Wojciech Rytter, Jakub Radoszewski

Publication date: 30 June 2014

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07566-2_21

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Algorithms on strings (68W32)

Related Items (9)

Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ Positive subharmonic solutions to superlinear ODEs with indefinite weight ⋮ Ranking and Unranking k-Subsequence Universal Words ⋮ The k-centre problem for classes of cyclic words ⋮ Locating patterns in the de Bruijn torus ⋮ Computation of Maximal Determinants of Binary Circulant Matrices ⋮ Necklaces and bracelets in R ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence ⋮ Ranking binary unlabelled necklaces in polynomial time

This page was built for publication: Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence