78 Citations (Scopus)

Abstract

The area of automatic groups has been one in which significant advances have been made in recent years. While it is clear that the definition of an automatic group can easily be extended to that of an automatic semigroup, there does not seem to have been a systematic investigation of such structures. It is the purpose of this paper to make such a study.

We show that certain results from the group-theoretic situation hold in this wider context, such as the solvability of the word problem in quadratic time, although others do not, such as finite presentability. There are also situations which arise in the general theory of semigroups which do not occur when considering groups; for example, we show that a semigroup S is automatic if and only if S with a zero adjoined is automatic, and also that S is automatic if and only if S with an identity adjoined is automatic. We use this last result to show that any finitely generated subsemigroup of a free semigroup is automatic. (C) 2001 Elsevier Science B.V. All rights reserved.

Original languageEnglish
Pages (from-to)365-391
Number of pages27
JournalTheoretical Computer Science
Volume250
Issue number1-2
DOIs
Publication statusPublished - 6 Jan 2001

Keywords

  • automatic
  • group
  • regular
  • semigroup
  • SMALL CANCELLATION THEORY
  • EASY MULTIPLICATIONS
  • SUBSEMIGROUPS

Fingerprint

Dive into the research topics of 'Automatic semigroups'. Together they form a unique fingerprint.

Cite this