Automatic presentations for semigroups

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © 2009 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Cain, A. J., Oliver, G., Ruškuc, N., & Thomas, R. M. (2009). Automatic presentations for semigroups. Information and Computation, 207(11), 1156–1168. https://doi.org/10.1016/j.ic.2009.02.005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free