TY - INPR
A1 - Deiß, Thomas
T1 - Conditional semi-Thue Systems for Presenting Monoids
N2 - There are well known examples of monoids in literature which do not admit a finite andcanonical presentation by a semi-Thue system over a fixed alphabet, not even over an arbi-trary alphabet. We introduce conditional Thue and semi-Thue systems similar to conditionalterm rewriting systems as defined by Kaplan. Using these conditional semi-Thue systems wegive finite and canonical presentations of the examples mentioned above. Furthermore weshow, that each finitely generated monoid with decidable word problem is embeddable in amonoid which has a finite canonical conditional presentation.
T3 - SEKI Report - 92,12
Y1 - 1999
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/336
UR - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-3073
ER -