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

DOI10.1016/J.TCS.2005.07.012zbMATH Open1079.68081OpenAlexW1986741335MaRDI QIDQ2575750FDOQ2575750

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

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

Cites Work

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

Cited In (5)

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Satisfiability of word equations with constants is in NEXPTIME 👍 👎
• The parametrisation of Solutions of the equation x–1y–1xyz–1v–1zv=1 in a free group 👍 👎
• Word equations in non-deterministic linear space 👍 👎
• Towards parametrizing word equations 👍 👎
• On the system of word equations \(x^ i_ 1 x^ i_ 2\dots x^ i_ m=y^ i_ 1 y^ i_ 2\dots y^ i_ n\) \((i=1,2,\dots)\) in a free monoid 👍 👎
• Mathematical Foundations of Computer Science 2004 👍 👎

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

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