The stabilizer of an infinite word w over a finite alphabet Σ is the monoid of morphisms over Σ
that fix w. In this paper we study various problems related to stabilizers and their generators …

A necessary and sufficient criterion for the existence and value of the frequency of a letter in
a morphic sequence is given. This is done using a certain incidence matrix associated with …

This work contributes to two aspects of the understanding of infinite words: the frequency of
letters in a morphic sequence and periodicity considerations on infinite words. First, we …

The study of combinatorics on words dates back at least to the beginning of the 20th century
and the work of Axel Thue. Thue was the first to give an example of an infinite word over a …

We prove that, for any pure morphic word w, if the frequencies of all letters in w exist, then
the frequencies of all factors in w exist as well. This result answers a question of Saari in his …

We present some asymptotic results about the frequency of a letter appearing in a
generalized unidimensional automatic sequence. Next, we study multidimensional …

The thesis examines the abelian properties of infinite words. Two finite words are said to be
abelian equivalent if for any given letter they contain the same number of occurrences of that …

In this thesis three open problems concerning Hanoi-type graphs are addressed. I prove a
theorem to determine all shortest paths between two arbitrary vertices s and t in the general …

In this thesis three open problems concerning Hanoi-type graphs are addressed. I prove a
theorem to determine all shortest paths between two arbitrary vertices s and t in the general …