If $G$ is a group which has a semigroup action on a regular rooted tree via prefixpreserving, continuous transformations (I give the tree the path metric), what kinds of algebraic restrictions can we put on $G$? I have seen a proof, for example, that any such group has decidable word problem, but do these groups need to be residually finite, for example? Thanks!
Take the 2minute tour
×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.
