Abstract
The author proves the solvability of the right and left divisibility problems, and consequently the word problem in semigroups with a system of defining relations that do not contain cycles. In particular the solvability of the word problem in groups without cycles is proved. Bibliography: 3 titles.
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
