Systems of word equations, polynomials and linear algebra: a new approach
From MaRDI portal
Publication:1631611
DOI10.1016/j.ejc.2015.01.005zbMath1403.68177arXiv1401.7498OpenAlexW2102446213MaRDI QIDQ1631611
Publication date: 6 December 2018
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.7498
Related Items
Word equations with \(k\)th powers of variables, On the Solution Sets of Entire Systems of Word Equations, One-Variable Word Equations and Three-Variable Constant-Free Word Equations, Unnamed Item, An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences, Algebraic properties of word equations, An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences
Cites Work
- Systems of equations over a free monoid and Ehrenfeucht's conjecture
- A proof of Ehrenfeucht's conjecture
- Equations in free semigroups
- On the independence of equations in three variables.
- On F-semigroups with three generators
- Many aspects of defect theorems
- On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
- On systems of word equations with simple loop sets
- Multiple constraints on three and four words
- On maximal chains of systems of word equations
- ON PARTITIONS SEPARATING WORDS
- ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS
- An Analysis and a Reproof of Hmelevskii’s Theorem
- Satisfiability of word equations with constants is in PSPACE
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
- The equivalence of deterministic gsm replications onQ-rational languages is decidable
- Uniqueness Theorems for Periodic Functions
- Local and global cyclicity in free semigroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
