Multiple constraints on three and four words

DOI10.1016/j.tcs.2007.10.026zbMath1133.68035OpenAlexW2014680670MaRDI QIDQ2474221

Elena Czeizler

Publication date: 5 March 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.026

zbMATH Keywords

word equationsdefect theoremindependent systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Systems of word equations, polynomials and linear algebra: a new approach ⋮ On maximal chains of systems of word equations

Cites Work

• Unnamed Item
• Systems of equations over a free monoid and Ehrenfeucht's conjecture
• Equations in free semigroups
• On the size of independent systems of equations in semigroups
• On the independence of equations in three variables.
• The non-parametrizability of the word equation \(xyz=zvx\): a short proof
• ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS
• Russian text(ignored)

This page was built for publication: Multiple constraints on three and four words