Use this URL to cite or link to this record in EThOS:
Title: Automatic semigroups : constructions and subsemigroups
Author: Descalco, L.
Awarding Body: University of St Andrews
Current Institution: University of St Andrews
Date of Award: 2002
Availability of Full Text:
Access from EThOS:
Access from Institution:
In 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.
Supervisor: Ruskuc, Nik Sponsor: Fundação para a Ciência e Tecnologia (Portugal)
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: QA182.D4 ; Semigroups