On the independence of equations in three variables.
From MaRDI portal
Publication:1426042
DOI10.1016/S0304-3975(03)00098-7zbMath1058.68085OpenAlexW2044452588MaRDI QIDQ1426042
Publication date: 14 March 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00098-7
Related Items (17)
Systems of word equations, polynomials and linear algebra: a new approach ⋮ A first step in characterizing three-element codes ⋮ Word equations in the context of string solving ⋮ ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS ⋮ The second step in characterizing a three-word code ⋮ On the Solution Sets of Entire Systems of Word Equations ⋮ Multiple constraints on three and four words ⋮ Binary codes that do not preserve primitivity ⋮ On systems of word equations over three unknowns with at most six occurrences of one of the unknowns ⋮ One-Variable Word Equations and Three-Variable Constant-Free Word Equations ⋮ On maximal chains of systems of word equations ⋮ One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations ⋮ The intersection of \(3\)-maximal submonoids ⋮ An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences ⋮ Algebraic properties of word equations ⋮ Binary codes that do not preserve primitivity ⋮ An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
Cites Work
This page was built for publication: On the independence of equations in three variables.
