Abstract
It is shown that it is undecidable in general whether or not a monoid that is presented by a finite special string-rewriting system is a group. The given proof uses the technique of canonical string-rewriting systems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
