| |
Morteza Mohammad-Noori
School of Mathematics, IPM
June 2-26, 2004 |
Abstract
Words (strings of symbols) have a principle role in computer processing.
Almost all computer softwares use algorithms on strings. These algorithms
are also widely used in other areas such as data compression, DNA sequence
analysis, computer graphics, and cryptography. Combinatorics on words
belongs to discrete mathematics and theoretical computer science, but also
it is related to many other branches of mathematics and computer science,
like automata, formal languages, probability, semigroups, groups,
dynamical systems, combinatorial topology and number theory. While the
history of combinatorics on words goes back to Axel Thue's works around
100 years ago, it was only in late 1950's when the systematic study of the
field was initiated. The generic topic of this field is to study general
properties of words, as well as sets, functions, and sequences of words.
In these lectures some aspects of these subjects are introduced.
|
Information |
| Time: | 14:00-15:30, every Saturdays and 10:00-11:30 every Wednesdays |
|
| Starting Date: | Wednesday, June 2, 2004 |
|
| Place: | School of Mathematics, Niavaran Bldg., Niavaran Square, Tehran, Iran. |
|
| |
|
