One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations

DOI10.1007/978-3-662-53132-7_27MaRDI QIDQ2817399zbMATH OpenOpenAlexFDO

Authors Dirk Nowotka, Aleksi Saarela

Publication date 30 August 2016

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53132-7_27

zbMATH Keywords

combinatorics on wordsword equationsindependent systems

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• One-variable word equations and three-variable constant-free word equations
• scientific article; zbMATH DE number 4077566
• On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
• Word equations with one unknown
• Word Equations with One Unknown
• scientific article; zbMATH DE number 1929939
• On word equations in one variable
• Word equations in nondeterministic linear space
• Word equations in non-deterministic linear space
• An optimal bound on the solution sets of one-variable word equations and its consequences

Cites work

• scientific article; zbMATH DE number 3987554 (Why is no real title available?)
• A proof of Ehrenfeucht's conjecture
• Algebraic properties of word equations
• On F-semigroups with three generators
• On maximal chains of systems of word equations
• On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
• On the independence of equations in three variables.
• On word equations in one variable
• One-variable word equations in linear time
• Systems of equations over a free monoid and Ehrenfeucht's conjecture
• Word equations with one unknown

Cited in

(8)

• One-variable word equations and three-variable constant-free word equations
• An optimal bound on the solution sets of one-variable word equations and its consequences
• Word equations with one unknown
• On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
• An optimal bound on the solution sets of one-variable word equations and its consequences
• ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS
• An Analysis and a Reproof of Hmelevskii’s Theorem
• Word Equations with One Unknown

This page was built for publication: One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations

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