加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本