Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.advisorRuškuc, Nik
dc.contributor.advisorNeunhöffer, Max
dc.contributor.authorPfeiffer, Markus Johannes
dc.coverage.spatial221en_US
dc.date.accessioned2013-06-12T14:33:42Z
dc.date.available2013-06-12T14:33:42Z
dc.date.issued2013-06-28
dc.identifier.urihttp://hdl.handle.net/10023/3671
dc.description.abstractThe word problem of a finitely generated group is commonly defined to be a formal language over a finite generating set. The class of finite groups has been characterised as the class of finitely generated groups that have word problem decidable by a finite state automaton. We give a natural generalisation of the notion of word problem from finitely generated groups to finitely generated semigroups by considering relations of strings. We characterise the class of finite semigroups by the class of finitely generated semigroups whose word problem is decidable by finite state automata. We then examine the class of semigroups with word problem decidable by asynchronous two tape finite state automata. Algebraic properties of semigroups in this class are considered, towards an algebraic characterisation. We take the next natural step to further extend the classes of semigroups under consideration to semigroups that have word problem decidable by a finite collection of asynchronous automata working independently. A central tool used in the derivation of structural results are so-called iteration lemmas. We define a hierarchy of the considered classes of semigroups and connect our original results with previous research.en_US
dc.language.isoenen_US
dc.publisherUniversity of St Andrews
dc.rightsCreative Commons Attribution 3.0 Unported
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/
dc.subjectAutomataen_US
dc.subjectComputationen_US
dc.subjectDecidabilityen_US
dc.subjectSemigroupsen_US
dc.subject.lccQA182.P44
dc.subject.lcshSemigroupsen_US
dc.subject.lcshWord problems (Mathematics)en_US
dc.subject.lcshIterative methods (Mathematics)en_US
dc.titleAdventures in applying iteration lemmasen_US
dc.typeThesisen_US
dc.contributor.sponsorUniversity of St Andrews. School of Mathematics and Statisticsen_US
dc.contributor.sponsorEngineering and Physical Sciences Research Council (EPSRC)en_US
dc.type.qualificationlevelDoctoralen_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US
dc.publisher.institutionThe University of St Andrewsen_US
dc.publisher.departmentSchool of Mathematics and Statisticsen_US


The following license files are associated with this item:

  • Creative Commons

This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution 3.0 Unported
Except where otherwise noted within the work, this item's license for re-use is described as Creative Commons Attribution 3.0 Unported