We prove that the word problem for semi-Thue systems is undecidable for systems where the derivation is always deterministic and reversible for words containing a single occurrence of a letter from a given set.
科研之友
微信
新浪微博
Facebook
分享链接
