中科院数学与系统科学研究院
华罗庚数学科学中心
量子信息报告
报告人：Alina Vdovina (Newcastle University)
题 目：Higher dimensional information theory
时 间：2019.07.25（星期四），15:00-16:00
地 点：数学院南楼N902室
摘 要：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’.
