Browsing Theses by Subject "combinatorics on words"
Now showing items 1-6 of 6
-
Automatic Sequences and Decidable Properties: Implementation and Applications
(University of Waterloo, 2013-09-19)In 1912 Axel Thue sparked the study of combinatorics on words when he showed that the Thue-Morse sequence contains no overlaps, that is, factors of the form ayaya. Since then many interesting properties of sequences began ... -
Deciding Properties of Automatic Sequences
(University of Waterloo, 2013-09-24)In this thesis, we show that several natural questions about automatic sequences can be expressed as logical predicates and then decided mechanically. We extend known results in this area to broader classes of sequences ... -
Decision Algorithms for Ostrowski-Automatic Sequences
(University of Waterloo, 2020-05-13)We extend the notion of automatic sequences to a broader class, the Ostrowski-automatic sequences. We develop a procedure for computationally deciding certain combinatorial and enumeration questions about such sequences ... -
The Frobenius Problem in a Free Monoid
(University of Waterloo, 2009-08-21)Given positive integers c1,c2,...,ck with gcd(c1,c2,...,ck) = 1, the Frobenius problem (FP) is to compute the largest integer g(c1,c2,...,ck) that cannot be written as a non-negative integer linear combination of c1,c2,...,ck. ... -
Properties of Two-Dimensional Words
(University of Waterloo, 2017-04-21)Combinatorics on words in one dimension is a well-studied subfield of theoretical computer science with its origins in the early 20th century. However, the closely-related study of two-dimensional words is not as popular, ... -
Repetition in Words
(University of Waterloo, 2013-08-23)The main topic of this thesis is combinatorics on words. The field of combinatorics on words dates back at least to the beginning of the 20th century when Axel Thue constructed an infinite squarefree sequence over a ternary ...