paper

On a finite state representation of

arXiv:2309.01241

Abstract

It is examined finite state automorphisms of regular rooted trees constructed to represent groups . The number of states of automorphisms that correspond to elementary matrices is computed. Using the representation of over an alphabet of size a finite state representation of the free group of rank over binary alphabet is constructed.