Please note: This PhD seminar will take place online.
Zihao Wang, PhD candidate
David R. Cheriton School of Computer Science
Supervisor: Professor Lila Kari
The sequence of Fibonacci strings is an infinite sequence of strings obtained from two initial letters f(1) = a and f(2) = b, by the recursive definition f(n+2) = f(n+1) f(n), for all positive integers. We first proposed a unified terminology to identify the different types of Fibonacci words and corresponding results under the umbrella term Fibonacci words in the extensive literature on the topic. Motivated by ideas stemming from theoretical studies of DNA computing, we then defined and explored involutive Fibonacci words (\phi-Fibonacci words and indexed \phi-Fibonacci words, where \phi denotes either a morphic or an antimorphic involution). We studied various properties of such words: structures, relationships, borderedness and primitivity.