Some semigroup-theoretic aspects of Rauzy graphs of subshifts

Description:  Symbolic dynamical systems, also called subshifts, correspond in a natural way to factorial prolongable languages. In this context, it is often relevant to study factor graphs, sometimes called Rauzy graphs, to which one gives a natural automaton structure. In this talk we first discuss the problem of knowing when the transition semigroup of this automaton is the syntactic semigroup of the language recognized by the graph. For minimal subshifts, we also discuss the meaning of the inverse limits of non-null regular J-classes of the graph's transition semigroups, and of the inverse limits of the profinite completions of the graph's homotopy groups. (Joint work with Jorge Almeida) Date:  2013-05-22 Start Time:   14:30 Speaker:  Alfredo Costa (CMUC/Univ. Coimbra) Institution:  FCTUC/CMUC Place:  Room 5.5 (DMUC) Research Groups: -Algebra and Combinatorics -Algebra, Logic and Topology See more:   <Main>