Semigroups with a context-free word problem

  • Authors:

  • Michael Hoffmann;Derek F. Holt;Matthew D. Owens;Richard M. Thomas

  • Affiliations:

  • Department of Computer Science, University of Leicester, Leicester, England;Department of Mathematics, University of Warwick, Coventry, England;Department of Mathematics, University of Warwick, Coventry, England;Department of Computer Science, University of Leicester, Leicester, England

  • Venue:
  • DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The word problem is of fundamental interest in group theory and has been widely studied. One important connection between group theory and theoretical computer science has been the consideration of the word problem as a formal language; a pivotal result here is the classification by Muller and Schupp of groups with a context-free word problem. Duncan and Gilman have proposed a natural extension of the notion of the word problem as a formal language from groups to semigroups and the question as to which semigroups have a context-free word problem then arises. Whilst the depth of the Muller-Schupp result and its reliance on the geometrical structure of Cayley graphs of groups suggests that a generalization to semigroups could be very hard to obtain we have been able to prove some results about this intriguing class of semigroups.