Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have