# Automatic semigroup

Automatic semigroup

In mathematics, an automatic semigroup is a finitely generated semigroup equipped with several regular languages over an alphabet representing a generating set. One of these languages determines "canonical forms" for the elements of the semigroup, the other languages determine if two canonical forms represent elements that differ by multiplication by a generator.

Formally, let $S$ be a semigroup and $A$ be a finite set of generators. Then an "automatic structure" for $S$ with respect to $A$ consists of a regular language $L$ over $A$ such that every element of $S$ has at least one representative in $L$ and such that for each $a in A cup \left\{varepsilon\right\}$, the relation consisting of pairs $\left(u,v\right)$ with $ua = v$ is regular.

The concept of an automatic semigroup was generalized from automatic groups by Campbell et al. (2001)

Unlike automatic groups (see Epstein et al. 1992), a semigroup may have an automatic structure with respect to one generating set, but not with respect to another. However, if an automatic semigroup has an identity, then it has an automatic structure with respect to any generating set (Duncan et al. 1999).

Decision problems

Like automatic groups, automatic semigroups have word problem solvable in quadratic time. Kambites & Otto (2006) showed that it is undecidable whether an element of an automatic monoid possesses a right inverse.

Cain (2006) proved that both cancellativity and left-cancellativity are undecidable for automatic semigroups. On the other hand, right-cancellativity is decidable for automatic semigroups (Silva & Steinberg 2004).

Geometric characterization

Automatic structures for groups have an elegant geometric characterization called the "fellow traveller property" (Epstein et al. 1992, ch. 2). Automatic structures for semigroups "possess" the fellow traveller property but are not in general characterized by it (Campbell et al. 2001). However, the characterization can be generalized to certain 'group-like' classes of semigroups, notably completely simple semigroups (Campbell et al. 2002) and group-embeddable semigroups (Cain et al. 2006).

Examples of automatic semigroups

*Bicyclic monoid
*Finitely generated subsemigroups of a free semigroup

References

*citation
last1 = Cain | first1 = Alan J.
title = Cancellativity is undecidable for automatic semigroups
journal = Quarterly Journal of Mathematics
volume = 57 | year = 2006 | issue = 3 | pages = 285–295
doi = 10.1093/qmath/hai023

*citation
last1 = Cain | first1 = Alan J.
last2 = Robertson | first2 = Edmund F.
last3 = Ruskuc | first3 = Nik
title = Subsemigroups of groups: presentations, Malcev presentations, and automatic structures
journal = Journal of Group Theory
volume = 9 | year = 2006 | issue = 3 | pages = 397–426
doi = 10.1515/JGT.2006.027
.

*citation
last1 = Campbell | first1 = Colin M.
last2 = Robertson | first2 = Edmund F.
last3 = Ruskuc | first3 = Nik
last4 = Thomas | first4 = Richard M.
title = Automatic semigroups
journal = Theoretical Computer Science
volume = 250 | year = 2001 | issue = 1–2 | pages = 365–391
doi = 10.1016/S0304-3975(99)00151-6
.

*citation
last1 = Campbell | first1 = Colin M.
last2 = Robertson | first2 = Edmund F.
last3 = Ruskuc | first3 = Nik
last4 = Thomas | first4 = Richard M.
title = Automatic completely simple semigroups
journal = Acta Mathematica Hungarica
volume = 95 | year = 2002 | issue = 3 | pages = 201–215
.

*citation
last1 = Duncan | first1 = A. J.
last2 = Robertson | first2 = E. F.
last3 = Ruskuc | first3 = N.
title = Automatic monoids and change of generators
journal = Mathematical Proceedings of the Cambridge Philosophical Society
volume = 127 | year = 1999 | issue = 3 | pages = 403–409
doi = 10.1017/S0305004199003722
.

*citation
last1 = Epstein | first1 = David B. A. | authorlink1 = David B. A. Epstein
last2 = Cannon | first2 = James W.
last3 = Holt | first3 = Derek F.
last4 = Levy | first4 = Silvio V. F.
last5 = Paterson | first5 = Michael S.
last6 = Thurston | first6 = William P. | authorlink6 = William Thurston
title = Word Processing in Groups
publisher = Jones and Bartlett Publishers | location = Boston, MA | year = 1992 | isbn = 0-86720-244-0
.

*citation
last1 = Kambites | first1 = Mark
last2 = Otto | first1 = Friedrich
title = Uniform decision problems for automatic semigroups
journal = Journal of Algebra
volume = 303 | year = 2006 | issue = 2 | pages = 789–809

*citation
last1 = Silva | first1 = P.V.
last2 = Steinberg | first1 = B.
title = A geometric characterization of automatic monoids
journal = Quarterly Journal of Mathematics
volume = 55 | issue = 3 | year = 2004 | pages = 333–356

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

• Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …   Wikipedia

### Share the article and excerpts

##### Direct link
Do a right-click on the link above
and select “Copy Link”