Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter University of Warsaw - Enumerative combinatorics - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Document Date: 2014-06-14 17:58:40 Open Document File Size: 328,65 KB Share Result on Facebook City Moscow / / Facility Wojciech Rytter University of Warsaw CPM / / Organization Wojciech Rytter University of Warsaw CPM / / Person Tomasz Kociumaka / Jakub Radoszewski / / SocialTag 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 WarsawAdd to Reading List