Vortrag im Oberseminar Theoretische Informatik

Titel

Parikh matrices of words and their algebraic properties

Ort und Zeit

Montag, 28. Januar 2013, 14 Uhr s.t., H 406

Zusammenfassung

Words and their Combinatorial properties constitute a relatively new and growing area of research that can be classified under Discrete Mathematics. A number of fundamental and significant mathematical results have been revealed in this study. This area can also be considered as a study of discrete sequences or a study of combinatorial properties of free monoids. A word is a finite or an infinite sequence of symbols taken from a finite set, called alphabet. A subword of a given word w is a subsequence of w. In the recent past, the notion of a special matrix, called Parikh Matrix, associated with a word, has been introduced and investigated. This matrix gives information on the number of certain subwords of a given word. This talk is intended to provide some background and highlight interesting results established by researchers in this topic of Parikh matrix. An extension of the notion of a Parikh matrix to picture arrays, which are rectangular arrangements of symbols, will also be indicated.

Vortragender

K. G. Subramanian is professor at the Universiti Sains Malaysia at Penang, Malaysia. Before, he worked at the Madras Christian College, Chennai, India. He published more than a hundred papers, mainly on formal languages and analytical functions.