Date of Thesis Acceptance
Major Department or Program
This thesis surveys the most important results regarding complete words, by which we mean words containing as subsequences every permutation of some set, and then considers two variants of the problem of finding the shortest complete words. The first of these asks for the shortest superpattern, which is a complete word with some additional requirements, and the second asks for the expected number of timesteps before a particular random process generates a complete word.
Permutations, Number theory, Combinatorics on words, Combinatorial analysis, Whitman College -- Dissertation collection 2015 -- Mathematics Department
Public Accessible Thesis
If you have questions about permitted uses of this content, please contact the ARMINDA administrator
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).