Constructing Almost Abelian Square-Free Words on Three Letters in C Language

Abstract

In this thesis, the process for extending almost abelian square-free words using the C program and the method used to implement parallel computing for faster execution time was reported. Moreover the method in checking for almost abelian square-freeness of a word was discussed as well. However main concern for this thesis was the programming task and optimizing the program finally obtained. The research final program does not make use of parallel computing. However the method to implement parallel computing for this program was discussed in hope to be used for future researches and improvements. This research was supervised by principal lecturer of mathematics, Veikko Keränen. Material for this research were based on his previous research papers, programming books and websites such as tutorialpoint.com that facilitated the implementation of the program. Through this research a program for extending almost abelian square-free words using suffix extension, i.e., extending a word by adding a letter at the suffix, were achieved. Additionally the implementation for parallel computing was discussed. Almost abelian square-free words were found for words of length over one thousand and three hundred. This result can be improved by making use of parallel computing, with the implementation of threads.