On a finite state representation of GL(n,Z)

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…