%0 Thesis
%D 2011
%T Abelian complexity of infinite words
%A Karel BÅ™inda
%X This thesis deals with Abelian complexity of infinite words, i.e., function describing complexity of a given infinite word using sets of Parikh vectors of finite factors of the word. Some of already known results for words generated by primitive substitutions (including connection between Abelian complexity, balance function, discrepancy function and matrix of a primitive substitution) are summarized. Then an explicit formula for Abelian complexity of infinite words associated with quadratic Parry numbers is derived. In addition, a new toolkit TigrWords, which facilitates study of infinite words approximated by their prefixes and may serve to discover of new hypotheses, is described.
%I Czech Technical University in Prague
%G eng
%U http://brinda.cz/publications/kb\_bach.pdf
%9 B.S. Thesis