Abstract
The unsolvability of some algorithmic problems is proved for equations in free groups and semigroups, namely, some simple properties of the solutions of the equations are determined and the absence of an algorithm permitting the determination of whether an arbitrary equation in a free group or semigroup has a solution with the properties introduced is proved.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have