Arrow Research search
Back to I&C

I&C 2009

Automatic presentations for semigroups

Journal Article journal-article Computer Science · Theoretical Computer Science

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.

Authors

Keywords

  • Automatic presentation
  • FA-presentable
  • Cancellative semigroup
  • Virtually abelian group

Context

Venue
Information and Computation
Archive span
1987-2026
Indexed papers
3021
Paper id
913590480632310636
v2026.09.13