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 be a semigroup and be a finite set of generators. Then an automatic structure for with respect to consists of a regular language over such that every element of has at least one representative in and such that for each, the relation consisting of pairs with 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).
Read more about Automatic Semigroup: Decision Problems, Geometric Characterization, Examples of Automatic Semigroups
Famous quotes containing the word automatic:
“What we learn for the sake of knowing, we hold; what we learn for the sake of accomplishing some ulterior end, we forget as soon as that end has been gained. This, too, is automatic action in the constitution of the mind itself, and it is fortunate and merciful that it is so, for otherwise our minds would be soon only rubbish-rooms.”
—Anna C. Brackett (1836–1911)