2 ms·
See tom7's portmontout http://tom7.org/portmantout/ http://tom7.org/portmantout/ an extension of portmanteau: https://en.m.wikipedia.org/wiki/Portmanteau htt
by alisonkisk 5y ago
See tom7's portmontout
http://tom7.org/portmantout/ http://tom7.org/portmantout/
an extension of portmanteau:
https://en.m.wikipedia.org/wiki/Portmanteau https://en.m.wikipedia.org/wiki/Portmanteau
De Bruijn sequence is more restricted: a cyclic portmontout over a "complete" lexicon of fixed sized words, where every possible string is a valid word.
- hinkley 5y agoStrictly speaking, treating the word list as a ring buffer might actually make it a little smaller. Perhaps more importantly, the cycle makes the problem almost exactly analogous to the Traveling Salesman Problem (Although there is an acyclic TSP, it is somewhat lacking in interesting properties like isomorphism)