Show simple item record

Files in this item

Thumbnail
Name:
cort_apsg.pdf
Size:
217.4Kb
Format:
PDF
View/Open

Automatic presentations for semigroups

Item metadata

dc.contributor.authorCain, Alan James
dc.contributor.authorOliver, Graham
dc.contributor.authorRuskuc, Nik
dc.contributor.authorThomas, Richard M.
dc.date.accessioned2012-01-04T12:41:51Z
dc.date.available2012-01-04T12:41:51Z
dc.date.issued2009-11
dc.identifier.citationCain , A J , Oliver , G , Ruskuc , N & Thomas , R M 2009 , ' Automatic presentations for semigroups ' , Information and Computation , vol. 207 , no. 11 , pp. 1156-1168 . https://doi.org/10.1016/j.ic.2009.02.005en
dc.identifier.issn0890-5401
dc.identifier.otherPURE: 2338248
dc.identifier.otherPURE UUID: 0114c872-96b1-4c8b-b07d-34e153348f5a
dc.identifier.otherWOS: 000271169800005
dc.identifier.otherScopus: 70349754454
dc.identifier.otherORCID: /0000-0003-2415-9334/work/73702035
dc.identifier.urihttps://hdl.handle.net/10023/2147
dc.descriptionSpecial Issue: 2nd International Conference on Language and Automata Theory and Applications (LATA 2008)en
dc.description.abstractThis 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.
dc.format.extent13
dc.language.isoeng
dc.relation.ispartofInformation and Computationen
dc.rightsThis is an author version of this article. The published version (c) 2009 Elsevier Inc. is available at www.sciencedirect.comen
dc.subjectAutomatic presentationen
dc.subjectFA-presentableen
dc.subjectCancellative semigroupen
dc.subjectVirtually abelian groupen
dc.subjectMonoidsen
dc.subjectQA Mathematicsen
dc.subject.lccQAen
dc.titleAutomatic presentations for semigroupsen
dc.typeJournal articleen
dc.contributor.sponsorEPSRCen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.identifier.doihttps://doi.org/10.1016/j.ic.2009.02.005
dc.description.statusPeer revieweden
dc.identifier.urlhttp://www.scopus.com/inward/record.url?scp=70349754454&partnerID=8YFLogxKen
dc.identifier.grantnumberEP/C523229/1en


This item appears in the following Collection(s)

Show simple item record

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.