Generic properties in some classes of automaton groups

03/27/2019
by   Thibault Godin, et al.
0

We prove, for various important classes of Mealy automata, that almost all generated groups have an element of infinite order. In certain cases, it also implies other results such as exponential growth.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2017

The word and order problems for self-similar and automata groups

We prove that the word problem is undecidable in functionally recursive ...
research
07/24/2023

Domino Snake Problems on Groups

In this article we study domino snake problems on finitely generated gro...
research
10/01/2018

Numerical upper bounds on growth of automata groups

The growth of a finitely generated group is an important geometric invar...
research
01/26/2021

Growth Functions, Rates and Classes of String-Based Multiway Systems

In context of the Wolfram Physics Project, a certain class of abstract r...
research
05/22/2019

The Steiner triple systems of order 21 with a transversal subdesign TD(3,6)

We prove several structural properties of Steiner triple systems (STS) o...
research
02/22/2019

Fast Computations on Ordered Nominal Sets

We show how to compute efficiently with nominal sets over the total orde...
research
12/17/2022

Automata and automatic sequences

In the following pages we discuss infinite sequences defined on a finite...

Please sign up or login with your details

Forgot password? Click here to reset