Nowadays combinatorics of words is widely studied. In the last decade a lot of papers and books, among these two realised by the French team Lothaire have been published. A special subject is the complexity of words. The language complexity of an infinite word is the number of its distinct subwords of a given length, which measures the randomness of the word. The rate of growth of this function is a fundamental characteristic of the infinite word and of the dynamical system associated to it. Several other functions, which measure the complexity of the finite and infinite words, are introduced. Complexity of words has many applications in symbolic dynamics, molecular biology (DNA-sequences), physics (quasi-crystals), mathematics (continued fraction expansion, fractals, transcendence) and computer science (pattern recognition). The talk will be a retrospective presentation with some results of the author, punctuating the applications.
Professor Zoltán Kása is a professor in Informatics at the Faculty of Mathematics and Informatics, Babes-Bolyai University in Cluj-Napoca (Romania). His interest is in combinatorics and programming. He teach subjects as: Formal Languages and Automata, Graph Theory, Complexity of Algorithms, Combinatorics. He has published 34 scientific papers and 9 books (these latter in Romanian and Hungarian). His homepage address is: http://www.cs.ubbcluj.ro/~kasa.
Sprecher: Dr. Zoltan Kasa Wann: Freitag, 7. Mai 2004, 14:00 Uhr (s.t.) Wo: E 1.42, Universität Klagenfurt