Subshifts of linear complexity and subgroups of finite index of free groups

Author: 
Dominique Perrin
Date: 
Mon, Jun 3, 2013 - Fri, Jun 7, 2013
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 
Develop automata theory inside a restricted set of words (typically the factors of a shift) Find classes of shifts for which some problems are simpler (examples below). Find natural generalizations of classes like Sturmian shifts (like normal sets below). Understand the role played by free groups in symbolic systems (Sturmian or interval exchange shifts).
Notes: