Academy of Mathematics and Systems Science, CAS Colloquia & Seminars
Speaker:
Alina Vdovina, Newcastle University
Inviter:
Title:
Higher dimensional information theory
Time & Venue:
2019.7.25 15:00-16:00 N902
Abstract:
We consider the set of all finite strings (also called finite words) over some finite alphabet with concatenation as the binary operation. Certain collections of such words, called in this context languages, form the basis of the modern complexity theory. Combinatorics on words has many theoretical and practical applications. The ideas of ‘higher-dimensional strings’, ‘higher-dimensional automata’ etc have been recurring ones within theoretical computer science. In this talk, I will describe a class of structures, which first arose within the theory of C*-algebras and which are generalizations of free monoids, whose elements can naturally be regarded as higher-dimensional strings. My main goal is to suggest that such structures can be viewed as a suitable setting for developing a theory of ‘combinatorics of higher dimensional words’.
Appendix：
Copyright@2008, All Rights Reserved, Academy of Mathematics and Systems Science, CAS
Tel: 86-10-82541777 Fax: 86-10-82541972 E-mail: contact@amss.ac.cn
