Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter University of Warsaw

First Page		Document Content
Date: 2014-06-14 17:58:40 Combinatorics on words Enumerative combinatorics Lyndon word De Bruijn sequence Sequence De Bruijn Combinatorics Mathematics Discrete mathematics		Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter University of Warsaw Add to Reading List Source URL: www.cs.ucr.edu Download Document from Source Website File Size: 328,65 KB Share Document on Facebook