Fabien Durand

1. On automorphism groups of low complexity subshifts
   2015/01/02 by Sebastián Donoso, Donoso, Sebastián, Fabien Durand +5 · 2 citations
   Computer Science · Mathematics · #37B10 #54H20 #Cellular Automata and Applications #Dynamical Systems (math.DS) #FOS: Mathematics #Mathematical Dynamics and Fractals #semigroups and automata theory
2. Cobham's theorem for substitutions
   2010/10/19 by Fabien Durand, Durand, Fabien · 1 citation
   Computer Science · #Algorithms and Data Compression #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #semigroups and automata theory
3. Interplay between finite topological rank minimal Cantor systems, \mathcal S-adic subshifts and their complexity
   2020/03/13 by Sebastián Donoso, Donoso, Sebastián, Fabien Durand +5 · 1 citation
   Computer Science · Mathematics · #37B10 #54H20 #Computability, Logic, AI Algorithms #Dynamical Systems (math.DS) #FOS: Mathematics #Mathematical Dynamics and Fractals #Topological and Geometric Data Analysis #semigroups and automata theory