کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10334735 690570 2005 4 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Divisibility problem for one relator monoids
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Divisibility problem for one relator monoids
چکیده انگلیسی
We describe an algorithm which partially solves the divisibility problem for monoids with one defining relation of a special form. It can be shown that the word problem for one-relator monoids can be reduced to the problem studied here. It is conjectured that the presented algorithm can be completed to an algorithm which gives full solution of the problem. The validity of the conjecture would imply the decidability of the word problem for one-relator monoids.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 339, Issue 1, 11 June 2005, Pages 3-6
نویسندگان
,