Automatic completely-simple semigroups

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)

Abstract

The notion of automaticity has been widely studied in groups and some progress has been made in understanding the notion in the wider context of semigroups. The purpose of this paper is to study automatic completely-simple semigroups. We show that, if S is a completely-simple seimgroup M[H; I; J; P] (with I and J finite), then S is automatic if and only if the group H is automatic. As a consequence, we deduce that automatic completely-simple semigroups are finitely presented. We also show that automatic completely-simple semigroups are characterized by the fellow traveller property and also that the existence of an automatic structure is independent of the choice of generating set.

Original languageEnglish
Pages (from-to)201-215
Number of pages15
JournalActa Mathematica Hungarica
Volume95
Issue number3
DOIs
Publication statusPublished - May 2002

Keywords

  • automatic group
  • automatic semigroup
  • regular language
  • completely-simple semigroup
  • Rees matrix semigroup
  • MONOIDS
  • PRESENTATIONS

Fingerprint

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

Cite this