Let be a presentation for the group . It is well known that is a quotient group of the free monoid with involution on , i.e. for some congruence . We recall that is a set of words all representing the identity of the group, i.e. for all . The word problem in the category of groups consists in establish whether or not two given words represent the same element of , i.e. whether or not .
Let be a presentation for the inverse monoid , where . The concept of presentation for inverse monoid is analogous to the group’s one, but now is a binary relation on , i.e. . The word problem in the category of inverse monoids consists in establish whether or not two given words represent the same element of , i.e. whether or not .
We can modify the last paragraph to introduce the word problem in the category of inverse semigroups as well.
A classical results in combinatorial group theory says that the word problem in the category of groups is undecidable, so it is undecidable also for the larger categories of inverse semigroups and inverse monoids.
- 1 W. W. Boone, Certain simple unsolvable problems in group theory, I, II, III, IV, V, VI, Nederl. Akad.Wetensch Proc. Ser. A57, 231-237,492- 497 (1954), 58, 252-256,571-577 (1955), 60, 22-27,227-232 (1957).
- 2 R. Lyndon and P. Schupp, Combinatorial Group Theory, Springer-Verlag, 1977.
- 3 P.S. Novikov, On the algorithmic unsolvability of the word problem in group theory, Trudy Mat. Inst. Steklov 44, 1-143 (1955).
- 4 J.B. Stephen, Presentation of inverse monoids, J. Pure Appl. Algebra 63 (1990) 81- 112.
|Date of creation||2013-05-17 17:00:19|
|Last modified on||2013-05-17 17:00:19|
|Last modified by||unlord (1)|