## Date of Award

2010

## Document Type

Campus Access Dissertation

## Department

Mathematics

## First Advisor

George F. McNulty

## Abstract

An algebra is a set of elements equipped with some finitary operations represented by a selected set of operation symbols. Using the operation symbols, we can form equations that describe identities in the algebra. We can investigate to see if the set of equations that hold in an algebra is axiomatizable by a finite set of equations, for which we call the algebra finitely based. If not, we can further ask if the algebra satisfies a stronger condition we call inherently nonfinitely based. For instance all finite groups and rings were shown in 1964 and 1973, respectively, to be finitely based.

A finite automaton can be represented in an algebraic way to give us a type of groupoid, which we call an automatic algebra. Automatic algebras are of interest because, unlike groups and rings, among finite automatic algebras there are examples, already in the literature, of finitely based algebras, inherently nonfinitely based algebras, and those that are neither.

In this dissertation we will begin to classify the finite automatic algebras into the three categories, as well as developing tools and methods useful for dealing with automatic algebras. We will see that there are plenty of examples of all three classifications. Each automatic algebra consists of a number of vertices and edge labels. For two vertex automatic algebras, we first reduce the infinitely many algebras down to 256 cases, of which only a fraction warrant special attention. With the three vertex automatic algebras the first step down from infinite gives us $2^{63} cases, of which we have barely scratched the surface.

## Rights

© 2010, John Boozer

## Recommended Citation

Boozer, J.(2010). *On the Finite Axiomatizability of Equational Theories of Automatic Algebras.* (Doctoral dissertation). Retrieved from https://scholarcommons.sc.edu/etd/315