On maximal chains of systems of word equations

DOI10.1134/S0081543811060083zbMath1297.68193arXiv1506.02913MaRDI QIDQ2510762

Aleksi Saarela, Juhani Karhumäki

Publication date: 4 August 2014

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.02913

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Systems of word equations, polynomials and linear algebra: a new approach ⋮ Word equations in the context of string solving ⋮ A compactness property of the \(k\)-abelian monoids ⋮ One-Variable Word Equations and Three-Variable Constant-Free Word Equations ⋮ One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations ⋮ An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences ⋮ An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Systems of equations over a free monoid and Ehrenfeucht's conjecture
• A proof of Ehrenfeucht's conjecture
• On the size of independent systems of equations in semigroups
• On the independence of equations in three variables.
• Many aspects of defect theorems
• On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
• Multiple constraints on three and four 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
• Local and global cyclicity in free semigroups