Abstract
Self-similar groups, or automata groups, consist of certain automorphisms of the infinite complete rooted binary tree. We describe them using several different concepts: computers are designed, portraits are drawn, and self-similar rules are written. Some well-known self-similar groups such as Grigorchuk’s group, the Adding Machine, and the Tower of Hanoi are explored.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
