Abstract
We study algorithmic problems for equations in free monoids and semigroups (equations in words and lengths) with additional restrictions on the solutions. It is proved that it is impossible to construct an algorithm that solves an arbitrary system of equations in words and lengths in a free monoid (free semigroup) of rank 2 with an additional constraint on the solution in the form that one of its components belongs to the language of balanced words or the equality of the projections of two components of the solution into a distinguished free generator to determine whether it has a solution. A similar result is obtained for systems of inequalities in words.
Sign-in/Register to access full text options 
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
