Systems of word equations, polynomials and linear algebra: a new approach (Q1631611): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
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: Multiple constraints on three and four words / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON NON-PERIODIC SOLUTIONS OF INDEPENDENT SYSTEMS OF WORD EQUATIONS OVER THREE UNKNOWNS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On systems of word equations over three unknowns with at most six occurrences of one of the unknowns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness Theorems for Periodic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many aspects of defect theorems / 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: Equations in free semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2702051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local and global cyclicity in free semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On systems of word equations with simple loop sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON PARTITIONS SEPARATING WORDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis and a Reproof of Hmelevskii’s Theorem / 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: Q4221612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of word equations with constants is in PSPACE / 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
Property / cites work
 
Property / cites work: Q3828202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of deterministic gsm replications onQ-rational languages is decidable / rank
 
Normal rank

Latest revision as of 14:13, 17 July 2024

scientific article
Language Label Description Also known as
English
Systems of word equations, polynomials and linear algebra: a new approach
scientific article

    Statements

    Systems of word equations, polynomials and linear algebra: a new approach (English)
    0 references
    0 references
    6 December 2018
    0 references

    Identifiers