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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
