Abstract
AbstractIt is known that the set of solutions of any constant-free three-variable word equation can be represented using parametric words, and the number of numerical parameters and the level of nesting in these parametric words is at most logarithmic with respect to the length of the equation. We show that this result can be significantly improved in the case of unbalanced equations, that is, equations where at least one variable has a different number of occurrences on the left-hand side and on the right-hand side. More specifically, it is sufficient to have two numerical parameters and one level of nesting in this case. We also discuss the possibility of proving a similar result for balanced equations in the future.
Publisher
Springer Science and Business Media LLC
Reference20 articles.
1. Jeż, A.: Word equations in non-deterministic linear space. J. Comput. Syst. Sci. 123, 122–142 (2022). https://doi.org/10.1016/j.jcss.2021.08.001
2. Albert, M.H., Lawrence, J.: A proof of Ehrenfeucht’s conjecture. Theoret. Comput. Sci. 41(1), 121–123 (1985). https://doi.org/10.1016/0304-3975(85)90066-0
3. Guba, V.S.: Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems. Matematicheskie Zametki. 40(3), 321–324 (1986). https://doi.org/10.1007/BF01142470
4. Saarela, A.: Hardness results for constant-free pattern languages and word equations. In: Proceedings of the 47th ICALP, LIPIcs, vol. 168 (Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2020), pp. 140:1–140:15. https://doi.org/10.4230/LIPIcs.ICALP.2020.140
5. Hmelevskiĭ, J.I.: Equations in free semigroups (American Mathematical Society, 1976). Translated by G. A. Kandall from the Russian original: Trudy Mat. Inst. Steklov. 107 (1971)