Automatic presentations for semigroups

  • Authors:
  • Alan J. Cain;Graham Oliver;Nik Ruškuc;Richard M. Thomas

  • Affiliations:
  • School of Mathematics and Statistics, University of St Andrews, North Haugh, St Andrews, Fife KY16 9SS, United Kingdom;Department of Computer Science, University of Leicester, University Road, Leicester LE1 7RH, United Kingdom;School of Mathematics and Statistics, University of St Andrews, North Haugh, St Andrews, Fife KY16 9SS, United Kingdom;Department of Computer Science, University of Leicester, University Road, Leicester LE1 7RH, United Kingdom

  • Venue:
  • Information and Computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper applies the concept of FA-presentable structures to semigroups. We give a complete classification of the finitely generated FA-presentable cancellative semigroups: namely, a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually abelian group. We prove that all finitely generated commutative semigroups are FA-presentable. We give a complete list of FA-presentable one-relation semigroups and compare the classes of FA-presentable semigroups and automatic semigroups.