(joint with Artur Jeż and Wojciech Plandowski)

Abstract:
In my talk I report on a recent joint work with Artut Jeż and Wojciech Plandowski. We describe the set of all solutions of equations in free groups and monoids with involution in the presence of rational constraints. This became possible due to the recently invented recompression technique of the second author. Jeż successfully applied the recompression technique for pure word equations without involution or rational constraints. In particular, his method could not be used as a black box for free groups (even without rational constraints). Actually, the presence of an involution (inverse elements) and rational constraints complicates the situation and some additional analysis is necessary. Still, the recompression technique is powerful enough to simplify proofs for many existing results in the literature. In particular, it simplifies proofs that solving word equations is in PSPACE (Plandowski 1999) and the corresponding result for equations in free groups with rational constraints (Diekert, Hagenah and Gutiérrez 2001). As a byproduct we obtain a direct proof that it is decidable in PSPACE whether or not the solution set is finite.