An automaton group: a computational case study.

zbMATH Open1297.20026MaRDI QIDQ2249194FDOQ2249194

Authors: M. Jelodari Mamaghani 

Publication date: 9 July 2014

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2209683
• scientific article; zbMATH DE number 1836316
• A fractal non-contracting class of automata groups.
• ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON
• Groups defined by automata

zbMATH Keywords

automata groupsgroups of exponential growthcontracting groupsweakly branch groupsorders of factor groups

Mathematics Subject Classification ID

Groups acting on trees (20E08) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cited In (6)

• A fractal non-contracting class of automata groups.
• How programming was used to determine factorizations of self-similar groups associated to the first Grigorchuk group
• Implementing computations in automaton (semi)groups
• The smallest Mealy automaton generating an indicable regular branch group
• Title not available (Why is that?)
• ON A TORSION-FREE WEAKLY BRANCH GROUP DEFINED BY A THREE STATE AUTOMATON

Uses Software

• GAP

This page was built for publication: An automaton group: a computational case study.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249194)