The non-parametrizability of the word equation \(xyz=zvx\): a short proof

DOI10.1016/j.tcs.2005.07.012zbMath1079.68081OpenAlexW1986741335MaRDI QIDQ2575750

Elena Czeizler

Publication date: 6 December 2005

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

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

zbMATH Keywords

Fibonacci numbersFibonacci wordWord equationsParametrizability

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (5)

Word equations in the context of string solving ⋮ ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS ⋮ Equations on partial words ⋮ Multiple constraints on three and four words ⋮ A logic for document spanners

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equations in free semigroups
• On cube-free \(\omega\)-words generated by binary morphisms
• Word equation \(ABC=CDA\), \(B\neq D\).
• Satisfiability of word equations with constants is in NEXPTIME
• Satisfiability of word equations with constants is in PSPACE
• DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP
• ON SYSTEMS OF EQUATIONS IN A FREE GROUP
• Equations in Free Groups
• Repetitions in the Fibonacci infinite word
• THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
• ON THE PARAMETERIZATION OF SOLUTIONS FOR EQUATIONS IN FREE GROUPS
• Mathematical Foundations of Computer Science 2004
• One-Variable Equations in Free Groups

This page was built for publication: The non-parametrizability of the word equation \(xyz=zvx\): a short proof