Parallel Generation of Abelian Pattern-Free Words on Three Letters
Gavrilenko, Aleksandr (2016)
Lapin ammattikorkeakoulu
2016
All rights reserved
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:amk-2016061513053
https://urn.fi/URN:NBN:fi:amk-2016061513053
Tiivistelmä
An abelian square is a word that can be divided into two consecutive parts such that the first part is a permutation (anagram) of the second part, that is, the number of occurrences of each letter is the same for the both parts. This thesis explores the programmatic approach to generation of long words not containing almost (that is, shortest one letter repetitions are allowed) abelian squares using Rust programming language.
The thesis briefly covers the history of the related field of combinatorics on words, the benefits of using Rust and the process of implementation of two programs that can be used to generate the longest word that does not contain almost abelian squares.
As the main result of the thesis, two programs utilizing different approaches were created. The programs can be used for the later research in the field.
The thesis briefly covers the history of the related field of combinatorics on words, the benefits of using Rust and the process of implementation of two programs that can be used to generate the longest word that does not contain almost abelian squares.
As the main result of the thesis, two programs utilizing different approaches were created. The programs can be used for the later research in the field.