Pages that link to "Item:Q3503102"
From MaRDI portal
The following pages link to ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS (Q3503102):
Displaying 10 items.
- Systems of word equations, polynomials and linear algebra: a new approach (Q1631611) (← links)
- On systems of word equations over three unknowns with at most six occurrences of one of the unknowns (Q2271428) (← links)
- Algebraic properties of word equations (Q2343519) (← links)
- Multiple constraints on three and four words (Q2474221) (← links)
- On maximal chains of systems of word equations (Q2510762) (← links)
- An Analysis and a Reproof of Hmelevskii’s Theorem (Q3533033) (← links)
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (Q3637246) (← links)
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences (Q5002823) (← links)
- One-relation languages and code generators (Q5021106) (← links)
- An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences (Q5026390) (← links)
