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.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:750281 |
| Date | January 2002 |
| Creators | Descalco, L. |
| Contributors | Ruskuc, Nik |
| Publisher | University of St Andrews |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://hdl.handle.net/10023/15122 |
Page generated in 0.0024 seconds