Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.advisorRuškuc, Nik
dc.contributor.authorDescalco, L.
dc.coverage.spatial163 p.en_US
dc.date.accessioned2018-07-09T11:34:37Z
dc.date.available2018-07-09T11:34:37Z
dc.date.issued2002
dc.identifier.urihttp://hdl.handle.net/10023/15122
dc.description.abstractIn this thesis we start by considering conditions under which some standard semigroup constructions preserve automaticity. We first consider Rees matrix semigroups over a semigroup, which we call the base, and work on the following questions: (i) If the base is automatic is the Rees matrix semigroup automatic? (ii) If the Rees matrix semigroup is automatic must the base be automatic as well? We also consider similar questions for Bruck-Reilly extensions of monoids and wreath products of semigroups. Then we consider subsemigroups of free products of semigroups and we study conditions that guarantee them to be automatic. Finally we obtain a description of the subsemigroups of the bicyclic monoid that allow us to study some of their properties, which include finite generation, automaticity and finite presentability.en_US
dc.language.isoenen_US
dc.publisherUniversity of St Andrewsen
dc.subject.lccQA182.D4
dc.subject.lcshSemigroupsen
dc.titleAutomatic semigroups : constructions and subsemigroupsen_US
dc.typeThesisen_US
dc.contributor.sponsorFundação para a Ciência e Tecnologia (Portugal)en_US
dc.type.qualificationlevelDoctoralen_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US
dc.publisher.institutionThe University of St Andrewsen_US


This item appears in the following Collection(s)

Show simple item record