<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T11:54:29Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/7785" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/7785</identifier><datestamp>2017-03-21T20:02:10Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="4fd84de4-7993-4251-ab1f-dd93e11023b3" confidence="600">Tan, Shuo</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2013-08-30T15:12:41Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2013-08-30T15:12:41Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2013-08-30T15:12:41Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2013-08-15</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/7785</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The study of combinatorial patterns of words has raised great interest since the early 20th century. In this master&amp;apos;s thesis presentation we study two combinatorial patterns. The first pattern is “abelian k-th power free” and the second one is “representability of sets of words of equal length”.&#xd;
&#xd;
For the first pattern we study the context-freeness of non-abelian k-th powers. A word is a non-abelian k-th power if it cannot be factorized in the form w1w2...wk where the wi are permutations of w1 for 2 ≤ i ≤ k. We show that neither the language of non-abelian squares nor the language of non- abelian cubes is context-free.&#xd;
&#xd;
For the second pattern we study the representability of a set of words of fixed length. A set S of words of length n is representable if there exists some word w such that the set of length-n factors of w equals S. We will give lower and upper bounds for the number of such representable sets. Furthermore, we study a variation of the problem: we fix a length t, and try to evaluate the number of sets of words of length n such that there exists some word w of length t such that the set of length-n factors of w equals S. We give a closed-form formula in the case where n ≤ t &amp;lt; 2n. In particular, we give a characterization on two distinct words having the same subset of length-n factors.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Abelian square</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Representable set</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Two results on words</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>