INVESTIGATION OF ALMOST ABELIAN SQUARE-FREE WORDS ON THREE LETTERS
Rijal, Subhash (2017)
Rijal, Subhash
Lapin ammattikorkeakoulu
2017
All rights reserved
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi:amk-201703032897
https://urn.fi/URN:NBN:fi:amk-201703032897
Tiivistelmä
In the study, a C program was developed for testing (almost) abelian square free words on three letters. The program was designed to read pre-generated sets of abelian square-free words, to test whether they are extendable, and finally to categorize them as favorable or unfavorable sets.
Computation of millions of words is a challenging task by computers with low processing capabilities. A conventional computer was used for programming and for testing the codes. Mostly, while testing, the boundary length for extensions was chosen small due to limited processing capacity of the computer and the subsequent enormous time consumption. The author also tested the program with higher boundary lengths and, after long computations, the results were found out to be correct.
The program was tested in many phases. The most challenging task was to process three different words at the same time with equivalent extensions and backtracking of letters.
It is anticipated that, in the near future, the program will be run in more sophisticated computers for studying a large number of words using a large boundary length.
Computation of millions of words is a challenging task by computers with low processing capabilities. A conventional computer was used for programming and for testing the codes. Mostly, while testing, the boundary length for extensions was chosen small due to limited processing capacity of the computer and the subsequent enormous time consumption. The author also tested the program with higher boundary lengths and, after long computations, the results were found out to be correct.
The program was tested in many phases. The most challenging task was to process three different words at the same time with equivalent extensions and backtracking of letters.
It is anticipated that, in the near future, the program will be run in more sophisticated computers for studying a large number of words using a large boundary length.