Results 1 to 1 of 1

Thread: Word problem for semigroups

  1. #1
    MHF Contributor Swlabr's Avatar
    May 2009

    Word problem for semigroups

    Let $\displaystyle \mathcal{P} = \langle X ;R \rangle$ be a semigroup which is not necessarilly finitely presented. Then it is natural to ask if you are given two words then are they equal modulo this presentation. This is the word problem (for semigroups).

    Assume the word problem is soluble for $\displaystyle \mathcal{P}$. Then my question is,

    if we are given two words $\displaystyle v$ and $\displaystyle w$ and we know they are equal modulo $\displaystyle \mathcal{P}$ then is it always possible to find the chain of relations connecting these two words?

    EDIT: I believe `complete' is the word I am looking for. However, I can't seem to find this anywhere (the WP is soluble for P if and only if P is complete. Apparently).
    Last edited by Swlabr; Jul 20th 2010 at 07:55 AM.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Replies: 5
    Last Post: May 31st 2011, 08:19 PM
  2. Replies: 3
    Last Post: Jan 2nd 2011, 08:20 PM
  3. Semigroups: Do the following 4 equations imply x=y?
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: Jun 2nd 2010, 12:37 AM
  4. Abstract Algebra: Semigroups
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: May 18th 2010, 03:39 PM
  5. Semigroups, Problems For Fun
    Posted in the Advanced Algebra Forum
    Replies: 1
    Last Post: Jun 16th 2009, 04:02 AM

Search Tags

/mathhelpforum @mathhelpforum