2015/08/18 by Rostislav Grigorchuk, Grigorchuk, Rostislav, Konstantin Medynets +1
Mathematics · #20E99 #20F05 #Dynamical Systems (math.DS) #FOS: Mathematics #Group Theory (math.GR) #math.DS #math.GR #msc:20E99 #msc:20F05
paper · pdf · doi:10.48550/arxiv.1508.04454
Some typos fixed
arxiv created 2015/09/15 · arxiv updated 2015/09/17
We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying subshift is recursive.