On word complexity of random substitution subshifts
Andrew Mitchell (University of Birmingham)
Thursday 30th November, 2023 16:00-17:00 Maths 311B
Abstract
Random substitutions are a generalisation of (deterministic) substitutions where the substituted image of a letter is chosen from a fixed finite set with respect to a probability distribution. In contrast to their deterministic counterparts, random substitutions often give rise to subshifts with positive topological entropy. In this talk, I will provide an introduction to random substitutions and their associated subshifts, and discuss recent progress towards classifying the functions which can be obtained as the complexity function of a random substitution subshift.
Add to your calendar
Download event information as iCalendar file (only this event)