2014/11/24 by Salo, Ville
#Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL)
paper · doi:10.48550/arxiv.1411.6644
We introduce the quasiminimal subshifts, subshifts having only finitely many subsystems. With ℕ-actions, their theory essentially reduces to the theory of minimal systems, but with ℤ-actions, the class is much larger. We show many examples of such subshifts, and in particular construct a universal system with only a single proper subsystem, refuting a conjecture of [Delvenne, Kůrka, Blondel, '05].