Intricacies of simple word equations: an example

DOI10.1142/S0129054107005212MaRDI QIDQ3401462zbMATH OpenOpenAlexFDO

Authors Elena Czeizler, Juhani Karhumäki, Markku Laine, Štěpán Holub

Publication date 29 January 2010

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054107005212

zbMATH Keywords

solutions of instances of PCPword equations

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• The non-parametrizability of the word equation \(xyz=zvx\): a short proof
• Mathematical Foundations of Computer Science 2004
• The hardness of solving simple word equations
• Equations on partial words
• scientific article; zbMATH DE number 1490005

Cites work

• Binary equality sets are generated by two words
• The equation x^i=y^jz^k in a free semigroup.

Cited in

(6)

• Formalizing a fragment of combinatorics on words
• Word equations in the context of string solving
• Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words
• Unavoidable regularities in long words with bounded number of symbol occurrences
• Periodicity forcing words
• On the dual Post correspondence problem

This page was built for publication: Intricacies of simple word equations: an example

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401462)