On the solution sets of three-variable word equations

DOI10.1007/S00224-024-10193-9MaRDI QIDQ6661760zbMATH OpenFDO

Authors Aleksi Saarela

Publication date 13 January 2025

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00224-024-10193-9

zbMATH Keywords

combinatorics on wordsentire systemparametric solutionunbalanced equationword equation

Mathematics Subject Classification ID

Semigroups (20Mxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A proof of Ehrenfeucht's conjecture
• An Analysis and a Reproof of Hmelevskii’s Theorem
• An optimal bound on the solution sets of one-variable word equations and its consequences
• Equations in free semigroups
• Equivalence of infinite systems of equations in free groups and semigroups to finite subsystems
• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 4103358 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• On F-semigroups with three generators
• On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
• On the independence of equations in three variables.
• On the Solution Sets of Entire Systems of Word Equations
• One-variable word equations and three-variable constant-free word equations
• Systems of word equations, polynomials and linear algebra: a new approach
• Uniqueness Theorems for Periodic Functions
• Word equations in non-deterministic linear space
• Word equations with one unknown

This page was built for publication: On the solution sets of three-variable word equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6661760)