|
Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10023/2147
| Title: | Automatic presentations for semigroups |
| Authors: | Cain, Alan J.
Oliver, Graham
Ruskuc, Nik
Thomas, Richard M. |
| Keywords: | Automatic presentation
FA-presentable
Cancellative semigroup
Virtually abelian group
Monoids
QA Mathematics |
| Issue Date: | Nov-2009 |
| Citation: | Cain , A J , Oliver , G , Ruskuc , N & Thomas , R M 2009 , ' Automatic presentations for semigroups ' Information and Computation , vol 207 , no. 11 , pp. 1156-1168 . |
| 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. (C) 2009 Elsevier Inc. All rights reserved. |
| Version: | Postprint |
| Description: | Special Issue: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008) |
| Status: | Peer reviewed |
| URI: | http://hdl.handle.net/10023/2147 |
| DOI: | http://dx.doi.org/10.1016/j.ic.2009.02.005 |
| ISSN: | 0890-5401 |
| Type: | Journal article |
| Rights: | This is an author version of this article. The published version (c) 2009 Elsevier Inc. is available at www.sciencedirect.com |
| Appears in Collections: | University of St Andrews Research
Applied Mathematics Research
Pure Mathematics Research
|
This item is protected by original copyright
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
