• Jollanda Shara
Keywords: -semigroup, FDT, string-rewriting systems, derivation graph, homotopy


In this paper we generalize the results of C.Squier ([1]) in the case of -monoids. We give, first,
the definition of -semigroups and some general results related to the -string rewriting
systems, the properties of confluence, termination, Church-Rosser, and so on. Finally, we prove
our main theorem which states that if is a finitely presented -monoid which has a
presentation involving a finite convergent -string rewriting system , then has finite
derivation type.

Author Biography

Jollanda Shara

Department of Mathematics&Computer Science, University “Eqrem Cabej”, 6001,
Gjirokaster, Albania


1. C.C.Squier, F.Otto,Y.Kobayashi, (1994), A finiteness condition for rewriting systems,
Theoretical Computer Science,131, 271-294.
2. C.Squier, (1987), Word problems and a homological finiteness condition for monoids,
Journal of Pure and Applied Algebra 49, 201-217.
3. C.Squier, F.Otto, (1987), The word problem for finitely presented monoids and finite
canonical rewriting systems.
4. Y.Lafont, (2006), Algebra and Geometry of Rewriting.
5. R.V.Book, F.Otto, (1993), String-Rewriting Systems, Springer-Verlag,New York.
6. P.A. Grillet, (2007), Abstract Algebra, 2nd edition, Springer.. E.Pasku, (2006),
7. Finiteness Conditions for Monoids and Small Categories, PhD Thesis,