ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS
From MaRDI portal
Publication:3503102
DOI10.1142/S0129054107005030zbMath1142.68463MaRDI QIDQ3503102
Juhani Karhumäki, Elena Czeizler
Publication date: 20 May 2008
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Related Items (10)
Systems of word equations, polynomials and linear algebra: a new approach ⋮ An Analysis and a Reproof of Hmelevskii’s Theorem ⋮ Multiple constraints on three and four words ⋮ On systems of word equations over three unknowns with at most six occurrences of one of the unknowns ⋮ On maximal chains of systems of word equations ⋮ On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations ⋮ An Optimal Bound on the Solution Sets of One-Variable Word Equations and its Consequences ⋮ Algebraic properties of word equations ⋮ One-relation languages and code generators ⋮ 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
- On the defect theorem and simplifiability
- On the size of independent systems of equations in semigroups
- On the independence of equations in three variables.
- On F-semigroups with three generators
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof
- Satisfiability of word equations with constants is in PSPACE
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
- The expressibility of languages and relations by word equations
This page was built for publication: ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS
