One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations (Q2817399): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A proof of Ehrenfeucht's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On F-semigroups with three generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of equations over a free monoid and Ehrenfeucht's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On word equations in one variable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence of equations in three variables. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic properties of word equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-variable word equations in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal chains of systems of word equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: WORD EQUATIONS WITH ONE UNKNOWN / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations / rank
 
Normal rank

Latest revision as of 12:31, 12 July 2024

scientific article
Language Label Description Also known as
English
One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations
scientific article

    Statements